@article{Coutinho2018-NN-Crypto,
	AUTHOR = {Coutinho, Murilo and de Oliveira Albuquerque, Robson and Borges, F\'{a}bio and Garc\'{i}a Villalba, Luis  Javier and Kim, Tai-Hoon},
	TITLE = {Learning Perfectly Secure Cryptography to Protect Communications with Adversarial Neural Cryptography},
	JOURNAL = {Sensors},
	VOLUME = {18},
	YEAR = {2018},
	NUMBER = {5},
	ARTICLE NUMBER = {1306},
	URL = {http://www.mdpi.com/1424-8220/18/5/1306},
	ISSN = {1424-8220},
	ABSTRACT = {Researches in Artificial Intelligence (AI) have achieved many important breakthroughs, especially in recent years. In some cases, AI learns alone from scratch and performs human tasks faster and better than humans. With the recent advances in AI, it is natural to wonder whether Artificial Neural Networks will be used to successfully create or break cryptographic algorithms. Bibliographic review shows the main approach to this problem have been addressed throughout complex Neural Networks, but without understanding or proving the security of the generated model. This paper presents an analysis of the security of cryptographic algorithms generated by a new technique called Adversarial Neural Cryptography (ANC). Using the proposed network, we show limitations and directions to improve the current approach of ANC. Training the proposed Artificial Neural Network with the improved model of ANC, we show that artificially intelligent agents can learn the unbreakable One-Time Pad (OTP) algorithm, without human knowledge, to communicate securely through an insecure communication channel. This paper shows in which conditions an AI agent can learn a secure encryption scheme. However, it also shows that, without a stronger adversary, it is more likely to obtain an insecure one.},
	DOI = {10.3390/s18051306}
}


@article{Borges2017Exp,
	title = "Parallel algorithms for modular multi-exponentiation",
	journal = "Applied Mathematics and Computation",
	volume = "292",
	number = "",
	pages = "406--416",
	year = "2017",
	note = "",
	issn = "0096-3003",
	xdoi = "http://dx.doi.org/10.1016/j.amc.2016.07.036",
	xurl = "http://www.sciencedirect.com/science/article/pii/S009630031630474X",
	author = "F{\'a}bio Borges and Pedro Lara and Renato Portugal",
	keywords = "Modular exponentiation",
	keywords = "Modular multi-exponentiation",
	keywords = "Parallelization",
	keywords = "Algorithms",
	keywords = "Cryptography ",
	abstract = "Abstract Modular exponentiation is a time-consuming operation widely used in cryptography. Modular multi-exponentiation, a generalization of modular exponentiation also used in cryptography, deserves further analysis from the algorithmic point of view. The parallelization of modular multi-exponentiation can be obtained by generalizing methods used to parallelize modular exponentiation. In this paper, we present a new parallelization method for the modular multi-exponentiation operation with two optimizations. The first one searches for the fastest solution without taking into account the number of processors. The second one balances the load among the processors and finds the smallest number of processors that achieves the fastest solution. In detail, our algorithms compute the product of i modular exponentiations. They split up each exponent in j blocks and start j threads. Each thread processes together i blocks from different exponents. Thus, each block of an exponent is processed in a different thread, but the blocks of different exponents are processed together in the same thread. Using addition chains, we show the minimum number of threads with load balance and optimal running time. Therefore, the algorithms are optimized to run with the minimum time and the minimum number of processors. "
}


@book{BorgesdeOliveira2017,
	author="{Borges de Oliveira}, F{\'a}bio",
	Title="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0"
}


@Inbook{BorgesdeOliveira2017Chap1,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Introduction",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="3--12",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_1",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_1"
}


@Inbook{BorgesdeOliveira2017Chap2,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Background and Models",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="13--23",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_2",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_2"
}

@Inbook{BorgesdeOliveira2017Chap3,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="A Selective Review",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="25--36",
	isbn="978-3-319-40718-0",
	xdoi="10.1007/978-3-319-40718-0\_3",
	xurl="http://dx.doi.org/10.1007/978-3-319-40718-0\_3"
}

@Inbook{BorgesdeOliveira2017Chap4,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Reasons to Measure Frequently and Their Requirements",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="39--47",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_4",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_4"
}


@Inbook{BorgesdeOliveira2017Chap5,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Quantifying the Aggregation Size",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="49--60",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_5",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_5"
}

@Inbook{BorgesdeOliveira2017Chap6,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Selected Privacy-Preserving Protocols",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="61--100",
	isbn="978-3-319-40718-0",
	xdoi="10.1007/978-3-319-40718-0\_6",
	xurl="http://dx.doi.org/10.1007/978-3-319-40718-0\_6"
}

@Inbook{BorgesdeOliveira2017Chap7,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Analytical Comparison",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="101--110",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_7",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_7"
}

@Inbook{BorgesdeOliveira2017Chap8,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Simulation and Validation",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="111--126",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_8",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_8"
}

@Inbook{BorgesdeOliveira2017Chap9,
	author="{Borges de Oliveira}, F{\'a}bio",
	title="Concluding Remarks",
	bookTitle="On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="127--129",
	isbn="978-3-319-40718-0",
	doi="10.1007/978-3-319-40718-0\_9",
	url="http://dx.doi.org/10.1007/978-3-319-40718-0\_9"
}

@INPROCEEDINGS{Oliveira2017Challenges, 
ieee={8038394}, 
author={L. B. Oliveira and F. M. Q. Pereira and R. Misoczki and D. F. Aranha and F. Borges and J. Liu}, 
booktitle={2017 26th International Conference on Computer Communication and Networks (ICCCN)}, 
title={The Computer for the 21st Century: Security Privacy Challenges after 25 Years}, 
year={2017}, 
pages={1-10}, 
abstract={Decades went by since Mark Weiser published his influential work on how a computer of the 21st century would look like. Over the years, some of the UbiComp features presented in that paper have been gradually adopted by industry players in the technology market. While this technological evolution resulted in many benefits to our society, it has also posed, along the way, countless challenges that we have yet to surpass. In this paper, we address major challenges from two areas that most afflict the UbiComp revolution: security and privacy. We examine open problems on software protection, long-term security, cryptography engineering, and privacy implications. We also point out promising directions towards the solutions of those problems. We claim that if we get all this right, we will turn the science fiction of UbiComp into science fact.}, 
keywords={Computer languages;Cryptography;Pervasive computing;Programming;Software;Tools}, 
doi={10.1109/ICCCN.2017.8038394}, 
month={July}}

@INPROCEEDINGS{Mannes2016ICN,
ieee={7502840}, 
author={E. Mannes and C. Maziero and L. C. Lassance and F. Borges}, 
booktitle={NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}, 
title={Assessing the impact of cryptographic access control solutions on multimedia delivery in information-centric networks}, 
year={2016}, 
pages={427-435}, 
abstract={Information-centric Networks (ICN) aims to improve content delivery by promoting the content as the protagonist of the network layer. By naming, routing, and forwarding named content directly on the network layer, ICN allows the same content to satisfy requests from different users, enabling innetwork caches to place contents strategically near the interested users. This characteristic is especially interesting for multimedia content distribution, since it represents a better quality of experience for users due to low round-trip time, bandwidth use, and load on content providers. However, caching protected multimedia content on uncontrolled third party devices may impair access control policies enforcement by the content providers. Many encryption-based access control solutions have been proposed for ICN, applying different cryptographic strategies leading to distinct features which may not be appropriate for multimedia content protection. In this paper, we simulate, evaluate, and discuss the individual characteristics of three encryption-based access control solutions in light of multimedia distribution in ICN. We show that leveraging cache efficiency, computational load to encrypt and decrypt content, and user revocation are the biggest challenges for the enforcement of access control policies on ICN.}, 
keywords={access control;cryptography;information networks;multimedia communication;quality of experience;telecommunication network routing;ICN;access control policies;computational load;cryptographic access control;cryptographic strategies;encryption based access control;in-network caches;information centric networks;multimedia content distribution;multimedia content protection;multimedia delivery;multimedia distribution;quality of experience;Access control;Communication channels;Encryption;Internet;Multimedia communication;Routing}, 
doi={10.1109/NOMS.2016.7502840}, 
month={April}}

@article{Borges2015Quantum,
	author = {Borges, Fábio and Santos, Raqueline A. M. and Marquezino, Franklin L.},
	title = {Preserving privacy in a smart grid scenario using quantum mechanics},
	journal = {Security and Communication Networks},
	volume = {8},
	number = {12},
	issn = {1939-0122},
	url = {http://dx.doi.org/10.1002/sec.1152},
	doi = {10.1002/sec.1152},
	pages = {2061--2069},
	keywords = {privacy, smart grid, quantum mechanics},
	year = {2015},
}

@INPROCEEDINGS{Vasquez2015Simon,
ieee={7426153}, 
author={J. d. C. G. Vasquez and F. Borges and R. Portugal and P. Lara}, 
booktitle={2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)}, 
title={An Efficient One-Bit Model for Differential Fault Analysis on Simon Family}, 
year={2015}, 
pages={61-70}, 
abstract={In this paper, we describe a family of symmetric cryptographic algorithms and present its cryptanalysis. Specifically, we use differential fault analysis to show a fault attack threat to the block cipher family named Simon. In addition, we present the improvement of a fault attack based on a differential attack method. Moreover, we are the first to to extract the entire secret key using only one round. This property is important because an attacker has to control the hardware to inject faults. However, if the attacker has control of only few hardware components and they compute only one round, previous attacks are not able to recover the entire key. With this side-channel analysis, an attacker can inject faults in one round of Simon with block of 96 or 128 bits to recover therespective entire key of 96 or 128 bits without using SAT solver neither computing Grobner bases. The key can be recoveredusing only differential fault analysis.}, 
keywords={cryptography;Simon family;block cipher family;cryptanalysis;differential attack method;differential fault analysis;fault attack threat;one-bit model;secret key extraction;side-channel analysis;symmetric cryptographic algorithms;Algorithm design and analysis;Ciphers;Hardware;Indexes;Performance evaluation;Schedules;Simon family;algorithms;cryptanalysis;fault attack;side-channel analysis;symmetric cryptography}, 
doi={10.1109/FDTC.2015.18}, 
month={Sept}}

@INPROCEEDINGS{Borges2015ECC,
ieee={7131862}, 
author={F. Borges and F. Volk and M. Mühlhäuser}, 
booktitle={2015 IEEE Power Energy Society Innovative Smart Grid Technologies Conference (ISGT)}, 
title={Efficient, verifiable, secure, and privacy-friendly computations for the smart grid}, 
year={2015}, 
pages={1-5}, 
abstract={In this paper, we present a privacy-preserving protocol between an energy provider and smart meters. Many details about the life of customers can be inferred from fine-grained information on their energy consumption. Different from other state-of-the-art protocols, the presented protocol addresses this issue as well as the integrity of electricity bills. Therefore, our protocol provides secure aggregation of measured consumption per round of measurement and verifiable billing after any period. Aggregation of measured consumption ensures that energy suppliers know the consolidated consumption of their customers. Verifiable billing ensures fairness for customers and their energy supplier. We adapt a homomorphic encryption scheme based on elliptic curve cryptography to efficiently protect the data series of measurements that are collected by smart meters. Moreover, energy suppliers can detect and locate energy loss or fraud in the power grid while retaining the privacy of all consumers.}, 
keywords={energy consumption;public key cryptography;smart meters;smart power grids;elliptic curve cryptography;energy consumption;homomorphic encryption scheme;privacy-friendly computations;privacy-preserving protocol;smart grid;smart meters;verifiable billing;Elliptic curve cryptography;Energy measurement;Phasor measurement units;Protocols;Smart grids;Smart meters;Data Series;Elliptic Curve Cryptography;Homomorphic Encryption;Performance;Privacy;Security;Smart Grid}, 
doi={10.1109/ISGT.2015.7131862}, 
month={Feb}}

@INPROCEEDINGS{Mannes2015ICN,
ieee={7405632}, 
author={E. Mannes and C. Maziero and L. Lassance and F. Borges}, 
booktitle={2015 IEEE Symposium on Computers and Communication (ISCC)}, 
title={Optimized access control enforcement over encrypted content in information-centric networks}, 
year={2015}, 
pages={924-929}, 
abstract={The Information-centric Network (ICN) paradigm is an important initiative toward an Internet architecture more suitable for content distribution. The change it imposes by naming, routing, and forwarding content directly on the network layer empowers the architecture with several interesting characteristics, such as in-network caching. As contents are meaningful for different users, they can be opportunistically cached and easily accessed by them, which improves content delivery and user experience. However, the fact that users can retrieve content through caches without interacting with the content provider raises security concerns regarding unauthorized access and the enforcement of access control policies. In this context, we propose an access control solution for ICN by adapting and optimizing a proxy re-encryption scheme, reducing up to 33% the processing time. The proposed solution is perfectly aligned with ICN demands, simultaneously ensuring content protection against unauthorized access of contents retrieved from unrestricted in-network caches as well as access control policies enforcement for legitimate users.}, 
keywords={Internet;authorisation;ICN;Internet architecture;content delivery;encrypted content;information-centric networks;optimized access control enforcement;proxy re-encryption scheme;user experience;Access control;Computer architecture;Encryption;Internet;Routing}, 
doi={10.1109/ISCC.2015.7405632}, 
month={July}}

@INPROCEEDINGS{Borges2014Certification,
ieee={7011241}, 
author={F. Borges and L. A. Martucci and F. Beato and M. Mühlhäuser}, 
booktitle={2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications}, 
title={Secure and Privacy-Friendly Public Key Generation and Certification}, 
year={2014}, 
pages={114-121}, 
abstract={Digital societies increasingly rely on secure communication between parties. Certificate enrollment protocols are used by certificate authorities to issue public key certificates to clients. Key agreement protocols, such as Diffie-Hellman, are used to compute secret keys, using public keys as input, for establishing secure communication channels. Whenever the keys are generated by clients, the bootstrap process requires either (a) an out-of-band verification for certification of keys when those are generated by the clients themselves, or (b) a trusted server to generate both the public and secret parameters. This paper presents a novel constrained key agreement protocol, built upon a constrained Diffie-Hellman, which is used to generate a secure public-private key pair, and to set up a certification environment without disclosing the private keys. In this way, the servers can guarantee that the generated key parameters are safe, and the clients do not disclose any secret information to the servers.}, 
keywords={cryptographic protocols;data privacy;private key cryptography;public key cryptography;telecommunication security;bootstrap process;certificate authorities;certificate enrollment protocols;certification environment;constrained Diffie-Hellman;digital societies;key agreement protocols;out-of-band verification;privacy-friendly public key generation;public key certificates;secret information;secret keys;secure communication channels;secure public-private key pair;Complexity theory;DH-HEMTs;Protocols;Public key;Servers;Zinc;Certification;Privacy;Protocol;Public Key Generation;Security}, 
doi={10.1109/TrustCom.2014.19}, 
ISSN={2324-898X}, 
month={Sept}}

@INPROCEEDINGS{Borges2014ADCNets,
ieee={6997528}, 
author={F. Borges and J. Buchmann and M. Mühlhäuser}, 
booktitle={2014 IEEE Conference on Communications and Network Security}, 
title={Introducing asymmetric DC-Nets}, 
year={2014}, 
pages={508-509}, 
abstract={This preliminary work lies in the intersection between DC-Nets and additive homomorphic encryptions. Both approaches are used to protect users' privacy. We introduce the concept of asymmetric DC-Nets that has good property of both approaches. Moreover, we construct one protocol based on integer numbers that fulfills all requirements to be classified as an asymmetric DC-Net. Many other protocols might be constructed to fulfill these requirements. Since asymmetric DC-Nets provide privacy-preserving aggregation of time-series data with verification, they have potential to be applied to e-voting, reputation systems, sensor networks, multi-party computation, and smart grids, among other application scenarios.}, 
keywords={cryptographic protocols;data privacy;additive homomorphic encryption;asymmetric DC-nets concept;e-voting;electronic voting;multi-party computation;privacy-preserving aggregation;reputation systems;sensor networks;smart grids;time-series data aggregation;user privacy protection;Aggregates;Elliptic curve cryptography;Privacy;Protocols;Smart grids}, 
doi={10.1109/CNS.2014.6997528}, 
month={Oct}}

@INPROCEEDINGS{Borges2014iKUP,
ieee={6997499}, 
author={F. Borges and L. A. Martucci}, 
booktitle={2014 IEEE Conference on Communications and Network Security}, 
title={iKUP keeps users' privacy in the Smart Grid}, 
year={2014}, 
pages={310-318}, 
abstract={Privacy-enhancing technologies for the Smart Grid usually address either the consolidation of users' energy consumption or the verification of billing information. The goal of this paper is to introduce iKUP, a protocol that addresses both problems simultaneously. iKUP is an efficient privacy-enhancing protocol based on DC-Nets and Elliptic Curve Cryptography as Commitment. It covers the entire cycle of power provisioning, consumption, billing, and verification. iKUP allows: (i) utility providers to obtain a consolidated energy consumption value that relates to the consumption of a user set, (ii) utility providers to verify the correctness of this consolidated value, and (iii) the verification of the correctness of the billing information by both utility providers and users. iKUP prevents utility providers from identifying individual contributions to the consolidated value and, therefore, protects the users' privacy. The analytical performance evaluation of iKUP is validated through simulation using as input a real-world data set with over 157 million measurements collected from 6,345 smart meters. Our results show that iKUP has a worse performance than other protocols in aggregation and decryption, which are operations that happen only once per round of measurements and, thus, have a low impact in the total protocol performance. iKUP heavily outperforms other protocols in encryption, which is the most demanded cryptographic function, has the highest impact on the overall protocol performance, and it is executed in the smart meters.}, 
keywords={cryptography;energy consumption;smart meters;smart power grids;DC-Nets;billing information verification;decryption;elliptic curve cryptography;energy consumption;iKUP;privacy-enhancing protocol;privacy-enhancing technologies;smart grid;smart meters;users' privacy;Encryption;Privacy;Protocols;Smart grids;Smart meters}, 
doi={10.1109/CNS.2014.6997499}, 
month={Oct}}

@ARTICLE{Borges2014TSG,
ieee={6862920}, 
author={F. Borges and M. Mühlhäuser}, 
journal={IEEE Transactions on Smart Grid}, 
title={EPPP4SMS: Efficient Privacy-Preserving Protocol for Smart Metering Systems and Its Simulation Using Real-World Data}, 
year={2014}, 
volume={5}, 
number={6}, 
pages={2701-2708}, 
abstract={The main contribution of this paper is the construction of the efficient privacy-preserving protocol for smart metering systems (EPPP4SMS), which brings together features of the best privacy-preserving protocols in the literature for smart grids. In addition, EPPP4SMS is faster on the meter side-and in the whole round (encryption, aggregation, and decryption)-than other protocols based on homomorphic encryption and it is still scalable. Moreover, EPPP4SMS enables energy suppliers and customers to verify the billing information and measurements without leaking private information. Since the energy supplier knows the amount of generated electricity and its flow throughout electrical substations, the energy supplier can use this verification to detect energy loss and fraud. Different from verification based on digital signature, our verification enables new features; for example, smart meters and their energy supplier can compute the verification without storing the respective encrypted measurements. Furthermore, EPPP4SMS may be suitable to many other scenarios that need aggregation of time-series data keeping privacy protected, including electronic voting, reputation systems, and sensor networks. In this paper, we present theoretical results of EPPP4SMS and their validation by implementation of algorithms and simulation using real-world measurement data.}, 
keywords={cryptographic protocols;data privacy;power system security;smart meters;smart power grids;substations;time series;EPPP4SMS;billing information verification;efficient privacy-preserving protocol for smart metering system;electrical substation;electricity generation;electronic voting;energy loss detection;homomorphic encryption;real-world data;reputation system;sensor network;smart grid;time-series data aggregation;Encryption;Power system security;Privacy;Protocols;Smart meters;Time series analysis;Homomorphic encryption;privacy;protocol;security;smart grid;time series}, 
doi={10.1109/TSG.2014.2336265}, 
ISSN={1949-3053}, 
month={Nov}}

@INPROCEEDINGS{Borges2014aggregationANDbilling
ieee={6912612}, 
author={F. Borges and D. Demirel and L. Böck and J. Buchmann and M. Mühlhäuser}, 
booktitle={2014 IEEE Symposium on Computers and Communications (ISCC)}, 
title={A privacy-enhancing protocol that provides in-network data aggregation and verifiable smart meter billing}, 
year={2014}, 
pages={1-6}, 
abstract={We present an innovative protocol combining innetwork data aggregation and smart meter billing for a smart grid scenario. The former enables an energy supplier to allocate and balance resources. The latter provides dynamic pricing schemes according to fine-grained consumption profiles. Moreover, smart meters and their energy supplier can prove their billing values. Since the energy supplier knows the amount of generated electricity and the consolidated consumption in a round of measurements, the energy supplier can detect energy loss and fraud. To preserve customers' privacy, we use a homomorphic commitment scheme with a homomorphic encryption scheme. All data sent from a meter to any other component in the communication network is either a commitment or an encrypted message. To provide security and privacy, we only require software modifications, leaving the hardware of the smart grid unchanged.}, 
keywords={cryptographic protocols;data communication;power system security;pricing;smart power grids;telecommunication security;communication network;encrypted message;energy supplier;homomorphic commitment scheme;homomorphic encryption scheme;in-network data aggregation;innovative protocol;privacy-enhancing protocol;resource allocation;resource balancing;smart grid;smart meters;verifiable smart meter billing;Electricity;Encryption;Privacy;Protocols;Public key;Smart meters;Homomorphic Commitment;Homomorphic Encryption;Privacy;Security;Smart Grid}, 
doi={10.1109/ISCC.2014.6912612}, 
ISSN={1530-1346}, 
month={June},}

@INPROCEEDINGS{Borges2012AnonymityNetworks,
ieee={6486013},
author={F. Borges and L. A. Martucci and M. Mühlhäuser}, 
booktitle={2012 IEEE Third International Conference on Smart Grid Communications (SmartGridComm)}, 
title={Analysis of privacy-enhancing protocols based on anonymity networks}, 
year={2012}, 
pages={378-383}, 
abstract={In this paper, we analyze privacy-enhancing protocols for Smart Grids that are based on anonymity networks. The underlying idea behind such protocols is attributing two distinct partial identities for each consumer. One is used to send real-time information about the power consumption, and the other for transmitting the billing information. Such protocols provide sender-anonymity for the real-time information, while consolidated data is sent for billing. In this work, the privacy properties of such protocols are analyzed, and their computational efficiency is evaluated and compared using simulation to other solutions based on homomorphic encryption.}, 
keywords={cryptographic protocols;data privacy;power system security;smart power grids;anonymity networks;homomorphic encryption;power consumption;privacy property;privacy-enhancing protocol analysis;smart grids;Electricity;Encryption;Hafnium;Privacy;Protocols;Real-time systems;Smart grids}, 
doi={10.1109/SmartGridComm.2012.6486013}, 
month={Nov},}


@inbook{Borges2017SBSeg,
	author = {Leonardo B. Oliveira and Fernando Magno Quint\~{a}o Pereira and Rafael Misoczki and Diego F. Aranha and F\'abio Borges and Michele Nogueira and Michelle Wangham},
	title = {O Computador para o Século 21: Desafios de Segurança e Privacidade após 25 Anos},
	booktitle = {XVII Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais - SBSeg 2017},
	year = {2017},
	date = {2017},
	language = {Portuguese},
	publisher = {Sociedade Brasileira de Computação - SBC},
	pages = {1-48},
	url = {http://www.lncc.br/~borges/doc/2017-sbseg-mc1.pdf},
	urldate = {2017},
	ISBN = {978-85-7669-410-6}
}

@inbook{Borges2016SBSeg,
	author = {Borges, F{\'a}bio},
	title = {Introdu{\c{c}}{\~a}o {\`a} Privacidade: Uma Abordagem Computacional},
	booktitle = {XVI Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais - SBSeg 2016},
	year = {2016},
	date = {2016},
	language = {Portuguese},
	publisher = {Sociedade Brasileira de Computação - SBC},
	pages = {1-43},
	url = {http://www.lncc.br/~borges/doc/2016-sbseg-mc1.pdf},
	urldate = {2017},
	ISBN = {978-85-7669-350-5}
}


@inbook{Borges2016Chapter,
	title = {Privacy-Preserving Data Aggregation in Smart Metering Systems},
	booktitle={Smarter Energy: From Smart Metering to the Smart Grid},
	author={F\'{a}bio Borges},
	editor={Sun, H. and Hatziargyriou, N. and Carpanini, L. and Poor, H.V.},
	isbn={9781785611049},
	series={Energy Engineering Series},
	url={https://books.google.com.br/books?id=Bkf8vQAACAAJ},
	year={2016},
	publisher={Institution of Engineering \& Technology}
}


@book{Borges2016Book,
	title={On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids},
	author="{Borges de Oliveira}, F{\'a}bio",
	isbn={9783319407180},
	url={http://books.google.com.br/books?id=4wXWDAAAQBAJ},
	year={2016},
	publisher={Springer International Publishing}
}


@article{Lara2012,
  author    = {Pedro Lara and
               Fábio Borges and
               Renato Portugal and
               Nadia Nedjah},
  title     = {Parallel modular exponentiation using load balancing without precomputation},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {78},
  number    = {2},
  year      = {2012},
  pages     = {575--582},
  ee        = {http://dx.doi.org/10.1016/j.jcss.2011.07.002},
}


@article{Autent-PLD,
Author = {Fábio Borges and Pedro C. S. Lara},
Title = {Autenticação e o Problema do Logaritmo Discreto},
Journal = {Revista Hífen},
Volume = {31},
Number = {59/60},
Year = {2007},
Pages = {106--111},
Address = {PUCRS Uruguaiana},
Publisher = {Gráfica Universitária},
ISSN = {0103-1155}, 
url = {http://revistaseletronicas.pucrs.br/fo/ojs/index.php/hifen/article/view/3884},
}

@inproceedings{EAMC2008.motivando,
Author = {Fábio Borges},
Title = {Motivando o Estudo da Matemática através da Criptografia},
Booktitle = {Resumos do I Encontro Acadêmico de Modelagem Computacional do Laboratório Nacional de Computação Científica},
Year = {2008},
Pages = {8},
Address = {Petrópolis - RJ},
url = {http://www.lncc.br/},
}

@inproceedings{EAMC2008.GF,
Author = {Raquel A. Souza and Fábio Borges},
Title = {Aplicações de GF($2^8$) no Algoritmo AES},
Booktitle = {Resumos do I Encontro Acadêmico de Modelagem Computacional do Laboratório Nacional de Computação Científica},
Year = {2008},
Pages = {32},
Address = {Petrópolis - RJ},
url = {http://www.lncc.br/},
}

@article{PHP.Webmail,
Author = {Gulherme Gall and Pedro Lara and Fábio Borges},
Title = {Webmail com Java + PHP},
Journal = {PHP Magazine},
Number = {04},
Year = {2008},
Pages = {27--30},
ISSN = {1981-044x}, 
url = {http://www.phpmagazine.com.br},
}


@inproceedings{SBSeg2007.EC,
Author = {Pedro C. S. Lara and Fábio Borges},
Title = {Curvas Elípticas: Aplicação em Criptografia Assimétrica},
Booktitle = {Workshop de Trabalhos de Iniciação Científica e de Graduação do Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais},
publisher = {Sociedade Brasileira de Computação (SBC)},
Year = {2007},
Pages = {1--10},
Address = {Rio de Janeiro},
url = {http://labcom.inf.ufrgs.br/ceseg/anais/2007/wticg/32553_1.pdf},
}


@inproceedings{CNMAC2007.stegano,
Author = {Fábio Borges and Renato Portugal and Jauvane Oliveira},
Title = {Steganography with Public-Key Cryptography for Videoconference},
Booktitle = {XXX CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2007},
Pages = {1--6},
Address = {Florianópolis - SC},
url = {http://congresscentral.com.br/cnmac/},
}

@inproceedings{SemMat2007.falando,
Author = {Fábio Borges},
Title = {Falando um segredo em público a um estranho e mantendo o segredo},
Booktitle = {XXIII Semana da Matemática},
Year = {2007},
Pages = {1--7},
Address = {Londrina - PR},
ISSN = {1981-9137}, 
url = {http://www.mat.uel.br/semana.htm},
}

@inproceedings{foz2006,
  author = {Fábio Borges and Renato Portugal and Jauvane C. Oliveira},
  journal = {Anais do Congresso de Matemática e suas Aplicações},
  publisher = {Foz2006},
  pages = {1--2},
  title = {Criptografia com números irracionais},
  url = {http://www.lncc.br/~borges/doc},
  year = {2006},
}


@inproceedings{SBSeg2008.pqdistantes,
Author = {Fábio Borges},
Title = {Um Novo Algoritmo Probabilístico para Fatoração de Inteiros com Primos Relativamente Distantes},
Booktitle = {Anais do VIII SBSeg - Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais},
publisher = {Sociedade Brasileira de Computação (SBC)},
Year = {2008},
Pages = {269--270},
Address = {Gramado - RS},
url = {http://sbseg2008.inf.ufrgs.br/proceedings/data/pdf/st05_01_resumo.pdf},
}


@inproceedings{SBSeg2009.paralel,
Author = {Pedro C. S. Lara,  Fábio Borges,  Renato Portugal},
Title = {Paralelização Eficiente para o Algoritmo Binário de Exponenciação Modular},
Booktitle = {Anais do IX Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais},
publisher = {Sociedade Brasileira de Computação (SBC)},
Year = {2009},
Pages = {17--26},
Address = {Campinas - SP},
url={http://www.lbd.dcc.ufmg.br/colecoes/sbseg/2009/002.pdf},
}

@inproceedings{UEL2007.insegura,
Author = {Pedro C. S. Lara and  Fábio Borges},
Title = {Curvas Elípticas de Aplicação Insegura},
Booktitle = {XXIII Semana da Matemática},
publisher = {Universidade Estadual de Londrina},
Year = {2007},
Address = {Londrina - PR},
}


@inproceedings{CNMAC2008.Ensino,
Author = {Fábio Borges},
Title = {Criptografia como Ferramenta para o Ensino de Matemática},
Booktitle = {XXXI CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2008},
Pages = {822--828},
Address = {Belém - PA},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxi_cnmac/PDF/189.pdf},
}


@inproceedings{CNMAC2008.BCH,
Author = {Raquel Souza and Fábio Borges},
Title = {Correção de Erros em Códigos BCH Binários},
Booktitle = {XXXI CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2008},
Pages = {492},
Address = {Belém - PA},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxi_cnmac/PDF/282.pdf},
}

@inproceedings{CNMAC2008.ECC,
Author = {Pedro Lara and Fábio Borges},
Title = {Métodos Gerais de Multiplicação por Escalar em Curvas Elípticas},
Booktitle = {XXXI CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2008},
Pages = {493},
Address = {Belém - PA},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxi_cnmac/PDF/317.pdf},
}


@inproceedings{CNMAC2008.GNFS,
Author = {Pedro Lara and Fábio Borges},
Title = {O Algoritmo de Fatoração GNFS},
Booktitle = {XXXI CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2008},
Pages = {494},
Address = {Belém - PA},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxi_cnmac/PDF/316.pdf},
}

@inproceedings{CNMAC2008.PageRank,
Author = {Veronica Werneck and Fábio Borges},
Title = {Classificando Páginas em Redes Desconexas com PageRank},
Booktitle = {XXXI CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2008},
Pages = {488},
Address = {Belém - PA},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxi_cnmac/PDF/206.pdf},
}


@inproceedings{CNMAC2010.Parallel, 
Author = {Pedro Lara and Fábio Borges and Renato Portugal},
Title = {Paralelização para o Algoritmo de Exponenciação Modular},
Booktitle = {XXXIII CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2010},
Pages = {73--79},
Address = {Águas de Lindóia - SP},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxiii_cnmac/pdf/90.pdf},
}

@inproceedings{CNMAC2009.Zp, 
Author = {Pedro Lara and Fábio Borges},
Title = {Implementação para Multiplicação por Escalar em Curvas Elípticas sobre Zp},
Booktitle = {XXXII CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2009},
Pages = {496--502},
Address = {Cuiabá - MT},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxii_cnmac/pdf/185.pdf},
}

@inproceedings{CNMAC2012.MQ, 
Author = {Fábio Borges and Albrecht Petzoldt and Renato Portugal},
Title = {Small private keys for systems of multivariate quadratic equations using symmetric cryptography},
Booktitle = {XXXIV CNMAC - Congrasso Nacional de Matemática Aplicada e Computacional},
Year = {2012},
Pages = {1085--1091},
Address = {Águas de Lindóia - SP},
url = {http://www.sbmac.org.br/eventos/cnmac/xxxiv_cnmac/pdf/578.pdf},
}