Distributed Paillier Cryptosystem without Trusted Dealer

Nishide, Takashi; Sakurai, Kouichi

doi:10.1007/978-3-642-17955-6_4

Cited by 40 publications

(58 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both applications use the cryptographic primitives of the Paillier Threshold Encryption Toolbox [21]. In this library, a centralized mechanism (with a trusted dealer) for threshold key generation [6] is implemented, instead of a distributed Paillier key generation [13]. In our view, this is enough for this prototype implementation.…”

Section: Resultsmentioning

confidence: 99%

“…The TAM Service collects the measurements and is responsible for coordinating the distributed key generation [13] for the public-key cryptosystem between itself and a group of L TV agents. These L agents are chosen with a verifiable random selection [7] and participate in both the public-key creation phase and the decryption of the results phase.…”

Section: The Privtam Systemmentioning

confidence: 99%

“…Then, the TAM Service and the L selected TV agents execute a cryptographic protocol for the distributed key generation of the Threshold Paillier Cryptosystem [6]. We use the following Threshold Decryption Model, which is an adaptation of the corresponding definition in [4] to our needs, so that the distributed key generation can be performed without a trusted dealer [13]. In PrivTAM, we use the Paillier public key generated in Phase 1 for the encryption of the viewership vectors and utilize the Pailler Cryptosystem's homomorphic property in Phase 2.…”

Section: Outline Of the Computationmentioning

confidence: 99%

See 2 more Smart Citations

Privacy-Preserving Television Audience Measurement Using Smart TVs

Drosatos

Tasidou

Efraimidis

2012

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract. Internet-enabled television systems, often referred to as Smart TVs, are a new development in television and home entertainment technologies. In this work, we propose a new, privacy-preserving, approach for Television Audience Measurement (TAM), utilizing the capabilities of the Smart TV technologies. We propose a novel application to calculate aggregate audience measurements using Smart TV computation capabilities and permanent Internet access. Cryptographic techniques, including homomorphic encryption and zero-knowledge proofs, are used to ensure both that the privacy of the participating individuals is preserved and that the computed results are valid. Additionally, participants can be compensated for sharing their information. Preliminary experimental results on an Android-based Smart TV platform show the viability of the approach.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: The Privtam Systemmentioning

confidence: 99%

Section: Outline Of the Computationmentioning

confidence: 99%

See 1 more Smart Citation

Privacy-Preserving Television Audience Measurement Using Smart TVs

Drosatos

Tasidou

Efraimidis

2012

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…This can be securely implemented by means of an additively homomorphic threshold decryption scheme like [18], which we denote by [.]. Since only outputs are decrypted, the server or any adversary will not learn the inputs.…”

Section: Improved Random User Selectionmentioning

confidence: 99%

Improved privacy of dynamic group services

Veugen

Doumen

Erkin

et al. 2017

EURASIP J. on Info. Security

View full text Add to dashboard Cite

We consider dynamic group services, where outputs based on small samples of privacy-sensitive user inputs are repetitively computed. The leakage of user input data is analysed, caused by producing multiple outputs, resulting from inputs of frequently changing sets of users. A cryptographic technique, known as random user selection, is investigated. We show the effect of random user selection, given different types of output functions, thereby disproving earlier work. A new security measure is introduced, which provably improves the privacy-preserving effect of random user selection, irrespective of the output function. We show how this new security measure can be implemented in existing cryptographic protocols. To investigate the effectiveness of our security measure, we conducted a couple of statistical simulations with large user populations, which show that it forms a key ingredient, at least for the output function addition. Without it, an adversary is able to determine a user input, with increasing accuracy when more outputs become available. When the security measure is implemented, an adversary remains oblivious of user inputs, even when thousands of outputs are collected. Therefore, our new security measure assures that random user selection is an effective way of protecting the privacy of dynamic group services.

show abstract

“…This set-up phase requires all nodes of the threshold cluster to engage in a distributed key generation protocol [39] for a threshold homomorphic cryptosystem [9]. At the end of this key generation phase, all the nodes of the threshold cluster receive the same public key pk and each gets a share of the private secret key (sk 1 , .…”

Section: Spp-computationmentioning

confidence: 99%

Scalable and Secure Polling in Dynamic Distributed Networks

Gambs

Guerraoui²,

Harkous³

et al. 2012

2012 IEEE 31st Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

Abstract-We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n 2 ) in an n nodes system, we present SPP (Secure and Private Polling), the first distributed polling protocol requiring only a communication complexity of O(n log 3 n), which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates ( > > 0 (not depending on n), and outputs the exact value of the poll with high probability. SPP is composed of two sub-protocols, which we believe to be interesting on their own: SPP-Overlay maintains a structured overlay when nodes leave or join the network, and SPP-Computation conducts the actual poll. We validate the practicality of our approach through experimental evaluations and describe briefly two possible applications of SPP: (1) an optimal Byzantine Agreement protocol whose communication complexity is Θ(n log n) and (2) a protocol solving an open question of King and Saia in the context of aggregation functions, namely on the feasibility of performing multiparty secure aggregations with a communication complexity of o(n 2 ).

show abstract

Distributed Paillier Cryptosystem without Trusted Dealer

Cited by 40 publications

References 36 publications

Privacy-Preserving Television Audience Measurement Using Smart TVs

Privacy-Preserving Television Audience Measurement Using Smart TVs

Improved privacy of dynamic group services

Scalable and Secure Polling in Dynamic Distributed Networks

Contact Info

Product

Resources

About