Article

A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

Authors:

PKC '01: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

Pages 119 - 136

Published: 13 February 2001 Publication History

Abstract

We propose a generalisation of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property. We show that the generalisation is as secure as Paillier's original system.

We construct a threshold variant of the generalised scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts.

We then show how these building blocks can be used for applying the scheme to efficient electronic voting.This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes.W e show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up to t out of L candidates. The same basic building blocks can also be adapted to provide receipt-free elections, under appropriate physical assumptions. The scheme for 1 out of L elections can be optimised such that for a certain range of parameter values, a ballot has size only O(log L) bits.

References

[1]

Baudron, Fouque, Pointcheval, Poupard and Stern: Practical Multi-Candidate Election Scheme, manuscript, May 2000.

Crossref

Google Scholar

[2]

Cramer, Damg�rd and Schoenmakers: Proofs of partial knowledge, Proc.of Crypto 94, Springer Verlag LNCS series nr. 839.

Google Scholar

[3]

R. Cramer, S. Dziembowski, I. Damg�rd, M. Hirt and T. Rabin: Efficient Multiparty Computations Secure against an Adaptive Adversary, Proc. of EuroCrypt 99, Springer Verlag LNCS series 1592, pp. 311-326.

Crossref

Google Scholar

[4]

R. Cramer, R. Gennaro, B. Schoenmakers: A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of EuroCrypt 97, Springer Verlag LNCS series, pp. 103-118.

Crossref

Google Scholar

[5]

Frankel, MacKenzie and Yung: Robust Efficient Distributed RSA-key Generation, proceedings of STOC 98.

Crossref

Google Scholar

[6]

P. Fouque, G.P oupard, J. Stern: Sharing Decryption in the Context of Voting or Lotteries, Proceedings of Financial Crypto 2000.

Crossref

Google Scholar

[7]

L. Guillou and J.-J. Quisquater: A Practical Zero-Knowledge Protocol fitted to Security Microprocessor Minimizing both Transmission and Memory, Proc. of EuroCrypt 88, Springer Verlag LNCS series.

Crossref

Google Scholar

[8]

M. Hirt and K. Sako: Efficient Receipt-Free Voting based on Homomorphic Encryption, Proceedings of EuroCrypt 2000, Springer Verlag LNCS series, pp. 539-556.

Crossref

Google Scholar

[9]

P. Pallier: Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, pp. 223-238.

Crossref

Google Scholar

[10]

V. Shoup: Practical Threshold Signatures, Proceedings of EuroCrypt 2000, Springer Verlag LNCS series, pp. 207-220.

Crossref

Google Scholar

[11]

J. Bar-Ilan, and D. Beaver: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds, Proceedings of the ACM Symposium on Principles of Distributed Computation, 1989, pp. 201-209.

Crossref

Google Scholar

Cited By

View all

Hwang SOzturk ETsudik G(2023)Balancing Security and Privacy in Genomic Range QueriesACM Transactions on Privacy and Security10.1145/357579626:3(1-28)Online publication date: 13-Mar-2023
https://dl.acm.org/doi/10.1145/3575796
Mainardi NBarenghi APelosi G(2021)Privacy-aware Character Pattern Matching over Outsourced Encrypted DataDigital Threats: Research and Practice10.1145/34623333:1(1-38)Online publication date: 22-Oct-2021
https://dl.acm.org/doi/10.1145/3462333
Wu YCai SXiao XChen GOoi B(2020)Privacy preserving vertical federated learning for tree-based modelsProceedings of the VLDB Endowment10.14778/3407790.340781113:12(2090-2103)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407811
Show More Cited By

Recommendations

A generalization of Paillier’s public-key system with applications to electronic voting
Special Issue on Special Purpose Protocols;Guest Editor:Moti Yung

We propose a generalization of Paillier’s probabilistic public-key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without losing the homomorphic ...
A Practical Public Key Cryptosystemfrom Paillier and Rabin Schemes
PKC '03: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography

We propose a practical scheme based on factoring and semantically secure (IND-CPA) in the standard model. The scheme is obtained from a modification of the so called RSA-Paillier [5] scheme. This modification is reminiscent of the ones applied by Rabin [...
On the Security of a Modified Paillier Public-Key Primitive
ACISP '02: Proceedings of the 7th Australian Conference on Information Security and Privacy

Choi et al. proposed the modified Paillier cryptosystem (M-Paillier cryptosystem). They use a special public-key g ZZ/nZZ such that g ^{( n )} = 1+ n mod n ², where n is the RSA modulus. The distribution of the public key g is different ...

Comments

Information & Contributors

Information

Published In

PKC '01: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

February 2001

421 pages

ISBN:3540416587

Editor:
Kwangjo Kim

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 13 February 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

220
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hwang SOzturk ETsudik G(2023)Balancing Security and Privacy in Genomic Range QueriesACM Transactions on Privacy and Security10.1145/357579626:3(1-28)Online publication date: 13-Mar-2023
https://dl.acm.org/doi/10.1145/3575796
Mainardi NBarenghi APelosi G(2021)Privacy-aware Character Pattern Matching over Outsourced Encrypted DataDigital Threats: Research and Practice10.1145/34623333:1(1-38)Online publication date: 22-Oct-2021
https://dl.acm.org/doi/10.1145/3462333
Wu YCai SXiao XChen GOoi B(2020)Privacy preserving vertical federated learning for tree-based modelsProceedings of the VLDB Endowment10.14778/3407790.340781113:12(2090-2103)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407811
Truex SBaracaldo NAnwar ASteinke TLudwig HZhang RZhou YCavallaro LKinder JAfroz SBiggio BCarlini NElovici YShabtai A(2019)A Hybrid Approach to Privacy-Preserving Federated LearningProceedings of the 12th ACM Workshop on Artificial Intelligence and Security10.1145/3338501.3357370(1-11)Online publication date: 11-Nov-2019
https://dl.acm.org/doi/10.1145/3338501.3357370
Rao FCao JBertino EKantarcioglu M(2019)Hybrid Private Record LinkageACM Transactions on Privacy and Security10.1145/331846222:3(1-36)Online publication date: 26-Apr-2019
https://dl.acm.org/doi/10.1145/3318462
Alexandru APappas GLiu XTabuada PPajic MBushnell L(2019)Encrypted LQG using labeled homomorphic encryptionProceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems10.1145/3302509.3311049(129-140)Online publication date: 16-Apr-2019
https://dl.acm.org/doi/10.1145/3302509.3311049
Miao CJiang WSu LLi YGuo SQin ZXiao HGao JRen K(2019)Privacy-Preserving Truth Discovery in Crowd Sensing SystemsACM Transactions on Sensor Networks10.1145/327750515:1(1-32)Online publication date: 9-Jan-2019
https://dl.acm.org/doi/10.1145/3277505
Jin BPark JMun H(2019)A Design of Secure Communication Protocol Using RLWE-Based Homomorphic Encryption in IoT Convergence Cloud EnvironmentWireless Personal Communications: An International Journal10.1007/s11277-018-6083-9105:2(599-618)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s11277-018-6083-9
Hazay CMikkelsen GRabin TToft TNicolosi A(2019)Efficient RSA Key Generation and Threshold Paillier in the Two-Party SettingJournal of Cryptology10.1007/s00145-017-9275-732:2(265-323)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s00145-017-9275-7
Dong XZhang WHu XLiu K(2018)A Cloud-User Watermarking Protocol Protecting the Right to Be Forgotten for the Outsourced Plain ImagesInternational Journal of Digital Crime and Forensics10.4018/IJDCF.201810010910:4(118-139)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.4018/IJDCF.2018100109
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

A generalization of Paillier’s public-key system with applications to electronic voting

A Practical Public Key Cryptosystemfrom Paillier and Rabin Schemes

On the Security of a Modified Paillier Public-Key Primitive

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations