Fair encryption of RSA keys

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1807, Issue , 2000, Pages 172-189

  Poupard, Guillaume ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ENCRYPTED DATA; KEY RECOVERY; PAILLIER CRYPTOSYSTEM; PRIVATE KEY; PUBLIC KEYS; PUBLIC-KEY ENCRYPTION; PUBLICLY VERIFIABLE; THIRD PARTIES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84948969076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_13     Document Type: Conference Paper

References (30)

1. N. Asokan, V. Shoup, and M. Waidner. optimistic Fair Exchange of Digital Signatures. In Eurocrypt ’98, LNCS 1403, pages 591-606. Springer-Verlag, 1998.
2. F. Bao. An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms. In CARDIS ’98, 1998.
3. J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987. Available from http://research.microsoft.com/~benaloh.
4. D. Boneh and R. Venkatesan. Breaking RSA May Not Be Equivalent to Factoring. In Eurocrypt ’98, LNCS 1403, pages 59-71. Springer-Verlag, 1998.
5. F. Boudot. Efficient Proofs that a Committed Number Lies in an Interval. In Eurocrypt 2000, LNCS 1807, pages 431-444. Springer-Verlag, 2000 (this volume).
6. J. Camenisch and M. Michels. A Group Signature Scheme with Improved Efficiency. In Asiacrypt ’98, LNCS 1514. Springer-Verlag, 1998.
7. J. Camenisch and M. Michels. Proving in Zero-Knowledge That a Number Is the Product of Two Safe Primes. In Eurocrypt ’99, LNCS 1592, pages 107-122. Springer-Verlag, 1999.
8. A. Chan, Y. Frankel, and Y. Tsiounis. Easy Come-Easy Go Divisible Cash. In Eurocrypt ’98, LNCS 1403, pages 561-575. Springer-Verlag, 1998. Available as GTE Tech report.
9. H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics 138. Springer-Verlag, 1993.
10. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Crypto ’86, LNCS 263, pages 186-194. Springer-Verlag, 1987.
11. PA. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. In Financial Cryptography 2000, LNCS. Springer-Verlag, 2000.
12. E. Fujisaki and T. Okamoto. A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. In Eurocrypt ’98, LNCS 1403, pages 32-46. Springer-Verlag, 1998.
13. M. Girault. Self-certified public keys. In Eurocrypt ’91, LNCS 547, pages 490-497. Springer-Verlag, 1992.
14. M. Girault and J. Stern. On the Length of Cryptographic Hash-Values used in Identification Schemes. In Crypto ’94, LNCS 839, pages 202-215. Springer-Verlag, 1994.
15. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28, 1984.
16. J. Kilian and F.T. Leighton. Fair Cryptosystems Revisited. In Crypto ’95, LNCS 963, pages 208-221. Springer-Verlag, 1995.
17. D. Naccache and J. Stern. A New Public Key Cryptosystem Based on Higher Residues. In Proc. of the 5th ACM-CCS, pages 59-66. ACM press, 1998.
18. T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. In Eurocrypt ’98, LNCS 1403, pages 308-318. Springer-Verlag, 1998.
19. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt ’99, LNCS 1592, pages 223-238. Springer-Verlag, 1999.
20. D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In Eurocrypt ’96, LNCS 1070, pages 387-398. Springer-Verlag, 1996.
21. J. M. Pollard. Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32(143):918-924, July 1978.
22. G. Poupard and J. Stern. Security Analysis of a Practical “on the fly” Authentication and Signature Generation. In Eurocrypt ’98, LNCS 1403, pages 422-436. Springer-Verlag, 1998.
23. G. Poupard and J. Stern. Short Proofs of Knowledge for Factoring. In Proceedings of PKC2000, LNCS 1751, pages 147-166. Springer-Verlag, 2000.
24. C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161-174, 1991.
25. B. Vallé. Gauss’ Algorithm Revisited. Journal of Algorithms, 12:556-572, 1991.
26. P. C. van Oorschot and M. J. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. In Eurocrypt ’96, LNCS 1070, pages 332-343. Springer-Verlag, 1996.
27. E. Verheul. Certificates of Recoverability with Scaleable Recovery Agent Security. In Proceedings of PKC2000, LNCS 1751. Springer-Verlag, 2000.
28. E. Verheul and H. van Tilborg. Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. In Eurocrypt ’97, LNCS 1233, pages 119-133. Springer-Verlag, 1997.
29. A. Young and M. Yung. Auto-Recoverable Auto-Certifiable Cryptosystems. In Eurocrypt ’98, LNCS 1403, pages 17-31. Springer-Verlag, 1998.
30. A. Young and M. Yung. RSA-based Auto-Recoverable Cryptosystems. In Proceedings of PKC2000, LNCS 1751. Springer-Verlag, 2000.