Article

Fair Public-Key Cryptosystems

Author:

CRYPTO '92: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Pages 113 - 138

Published: 16 August 1992 Publication History

Abstract

We show how to construct public-key cryptosystems that are fair, that is, strike a good balance, in a democratic country, between the needs of the Government and those of the Citizens. Fair public-key cryptosystems guarantee that: (1) the system cannot be misused by criminal organizations and (2) the Citizens mantarn exactly the same rights to privacy they currently have under the law.We actually show how to transform any public-key cryptosystem into a fair one. The transformed systems preserve the security and efficiency of the original ones. Thus one can still use whatever system he believes to be more secure, and enjoy the additional properties of fairness. Moreover, for today's best known cryptosystems, we show that the transformation to fair ones is particularly efficient and convenient.As we shall explain, our solution compares favorably with the Clipper Chip, the encryption proposal more recently put forward by the Clinton Administration for solving similar problems.

References

[1]

B. Awerbuch, B. Chor, S. Goldwasser and S. Micali. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In Proceedings of the 26th Annual IEEE Symposium of Foundations of Computer Science . IEEE, New York, 1986, pp. 383-395.

Crossref

Google Scholar

[2]

J. Benaloh. Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret. Advances in Cryptoiogy -Proceedings of Crypto '86. Springer Verlag, 1986.

Crossref

Google Scholar

[3]

M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Fault-Tolerant Distributed Computing. In Proceedings of the 20th ACM Symposium of Theory of Computing . ACM, New York, 1988, pp. 1-10.

Crossref

Google Scholar

[4]

G. Blakley. Safeguarding Cryptographic Kevs. In AFIPS - Conference Proceedings . NCC, New Jersey, 1979, Vol. 48 (June), pp. 313-317.

Google Scholar

[5]

M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. Siam Journal on Computing , 1984, vol. 13 (Novenber), pp. 850-863. Proceeding Version: FOCS 1982.

Crossref

Google Scholar

[6]

D. Chaum, C. Crepeau, and I. Damgard. Multi-party Unconditionally Secure Protocols. In Proceedings of the 20th ACM Symposium of Theory of Computing . ACM, New York, 1988, pp. 11-19.

Crossref

Google Scholar

[7]

W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Inform. Theory . IT-22, 6 (Nov. 1976), IEEE, New York, pp. 644-554.

Google Scholar

[8]

P. Feldman. A Practical Scheme for Non-Interactive verifiable Secret Sharing. In Proceedings of the 28th Annual IEEE Symposium of Foundations of Computer Science . IEEE, New York, 1987, pp. 427-438.

Crossref

Google Scholar

[9]

S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer Systems Science . Academic Press, New York, Vol. 28 No. 2 (1984). pp. 270-299.

Google Scholar

[10]

O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design. In Proceedings of the 27th Annual IEEE Symposium of Foundations of Computer Science . IEEE, New York, 1986, pp. 174-187.

Crossref

Google Scholar

[11]

O. Goldreich, S. Micali, and A. Wigderson. How To Play ANY Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium of Theory of Computing . ACM, New York, 1987, pp. 218-229.

Crossref

Google Scholar

[12]

T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proceedings of the 21st ACM Symposium of Theory of Computing . ACM, New York, 1989, pp. 73-85.

Crossref

Google Scholar

[13]

R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystens. Comm. ACM 21, 2 (Feb. 1978), pp. 120-126.

Crossref

Google Scholar

[14]

A. Shamir. How to Share a Secret. Communications of the ACM . ACM, New York, 1979, Vol. 22, No. 11 (Nov.), pp. 612-613.

Crossref

Google Scholar

Cited By

View all

Trevathan JRead WGhodosi HAtkinson I(2011)Privacy and anonymity in untrusted data storesProceedings of the Twenty-Second Australasian Database Conference - Volume 11510.5555/2460396.2460407(75-84)Online publication date: 17-Jan-2011
https://dl.acm.org/doi/10.5555/2460396.2460407
Jhanwar M(2011)A practical (non-interactive) publicly verifiable secret sharing schemeProceedings of the 7th international conference on Information security practice and experience10.5555/2009103.2009130(273-287)Online publication date: 30-May-2011
https://dl.acm.org/doi/10.5555/2009103.2009130
D'Souza RJao DMironov IPandey O(2011)Publicly verifiable secret sharing for cloud-based key managementProceedings of the 12th international conference on Cryptology in India10.1007/978-3-642-25578-6_21(290-309)Online publication date: 11-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25578-6_21
Show More Cited By

Fair Public-Key Cryptosystems

Recommendations

Securely combining public-key cryptosystems
CCS '01: Proceedings of the 8th ACM conference on Computer and Communications Security

It is a maxim of sound computer-security practice that a cryptographic key should have only a single use. For example, an RSA key pair should be used only for public-key encryption or only for digital signatures, and not for both.In this paper we show ...
Chosen ciphertext secure keyed-homomorphic public-key cryptosystems

In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can "freely" perform the operation inevitably means ...
Immunizing public key cryptosystems against chosen ciphertext attacks

Three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks are presented. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CRYPTO '92: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

August 1992

593 pages

ISBN:3540573402

Editor:
Ernest F. Brickell

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 16 August 1992

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Trevathan JRead WGhodosi HAtkinson I(2011)Privacy and anonymity in untrusted data storesProceedings of the Twenty-Second Australasian Database Conference - Volume 11510.5555/2460396.2460407(75-84)Online publication date: 17-Jan-2011
https://dl.acm.org/doi/10.5555/2460396.2460407
Jhanwar M(2011)A practical (non-interactive) publicly verifiable secret sharing schemeProceedings of the 7th international conference on Information security practice and experience10.5555/2009103.2009130(273-287)Online publication date: 30-May-2011
https://dl.acm.org/doi/10.5555/2009103.2009130
D'Souza RJao DMironov IPandey O(2011)Publicly verifiable secret sharing for cloud-based key managementProceedings of the 12th international conference on Cryptology in India10.1007/978-3-642-25578-6_21(290-309)Online publication date: 11-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25578-6_21
Mukhamedov ARyan M(2010)Identity Escrow Protocol and Anonymity Analysis in the Applied Pi-CalculusACM Transactions on Information and System Security10.1145/1880022.188003513:4(1-29)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1145/1880022.1880035
Mukhamedov ARyan M(2007)Anonymity protocol with identity escrow and analysis in the applied π-calculusProceedings of the 3rd conference on Trustworthy global computing10.5555/1793574.1793598(330-346)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.5555/1793574.1793598
Mukhamedov ARyan M(2005)On anonymity with identity escrowProceedings of the Third international conference on Formal Aspects in Security and Trust10.1007/11679219_17(235-243)Online publication date: 18-Jul-2005
https://dl.acm.org/doi/10.1007/11679219_17
Steketee CBrown JGonzález Nieto JMontague P(2005)GBD threshold cryptography with an application to RSA key recoveryProceedings of the 10th Australasian conference on Information Security and Privacy10.1007/11506157_33(394-405)Online publication date: 4-Jul-2005
https://dl.acm.org/doi/10.1007/11506157_33
Burmester MMagkos EChrissikopoulos V(2004)Uncoercible e-Bidding GamesElectronic Commerce Research10.1023/B:ELEC.0000009284.64158.0a4:1-2(113-125)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.1023/B%3AELEC.0000009284.64158.0a
Burmester MDesmedt YWright RYasinsac A(2004)Accountable privacyProceedings of the 12th international conference on Security Protocols10.1007/11861386_10(83-95)Online publication date: 26-Apr-2004
https://dl.acm.org/doi/10.1007/11861386_10
Desmedt YWang Y(2002)Efficient zero-knowledge proofs for some practical graph problemsProceedings of the 3rd international conference on Security in communication networks10.5555/1766811.1766840(290-302)Online publication date: 11-Sep-2002
https://dl.acm.org/doi/10.5555/1766811.1766840
Show More Cited By

Abstract

References

Cited By

Recommendations

Securely combining public-key cryptosystems

Chosen ciphertext secure keyed-homomorphic public-key cryptosystems

Immunizing public key cryptosystems against chosen ciphertext attacks

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations