Guaranteed correct sharing of integer factorization with Off-line shareholders

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

Volumn 1431, Issue , 1998, Pages 60-71

  Mao, Wenbo ^a  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FACTORIZATION; SHAREHOLDERS;

INTEGER FACTORIZATION; INTEGER TO; MULTI-PARTY PROTOCOLS; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS; SECRET SHARING; UNIVERSAL VERIFIABILITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84958986003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054015     Document Type: Conference Paper

References (24)

1. M. Bellare and S. Goldwasser. Verifiable partial key escrow. In Proceedings of 4th ACM Conference on Computer and Communications Security. Zurich, April 1997.
2. M. Blum. Coin flipping by telephone: a protocol for solving impossible problems. In Proceedings of 24th IEEE Computer Conference (CompCon), pages 133-137. 1982.
3. R. Cramer, I. Damgard and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology - Proceedings of CRYPTO'94 (LNCS 839), pages 174-187. Springer-Verlag, 1994.
4. R. Cramer, R. Gennaro and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology - Proceedings of EUROCRYPT'97 (LNCS 1233), pages 103-118. Springer-Verlag, 1997.
5. D. Denning and D. Branstad. A taxonomy for key escrow encryption systems. Communications of the ACM. 39,3 March 1996, pages 34-40.
6. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Advances in Cryptology - Proceedings of CRYPTO'89 (LNCS 435), pages 307-315. Springer-Verlag, 1990.
7. T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469-472, July 1985.
8. A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In Advances in Cryptology - Proceedings of CRYPTO'86 (LNCS 263), pages 186-194. Springer-Verlag, 1987.
9. J. van de Graaf and R. Peralta. A simple and secure way to show the validity of your public key. In Advances in Cryptology - Proceedings of CRYPTO'87 (LNCS 293), pages 128-134. Springer-Verlag, 1988.
10. J.A. Gordon. Strong primes are easy to find. In Advances in Cryptology -roceedings of EUROCRYPT'84 (LNCS 209), pages 216-223. Springer-Verlag, 1985.
11. J. Kilian and T. Leighton. Fair cryptosystems, revisited. A Rigorous approach to key-escrow. In Advances in Cryptology - Proceedings of CRYPTO'95 (LNCS 963), pages 208-221. Springer-Verlag, 1995.
12. A.K. Lenstra, P. Winkler and Y. Yacobi. A key escrow system with warrant bounds. In Advances in Cryptology - Proceedings of CRYPTO'95 (LNCS 963), pages 197-207. Springer-Verlag, 1995.
13. S. Micali. Fair public key cryptosystems. In Advances in Cryptology - Proceedings of CRYPTO'92 (LNCS 740), pages 113-138. Springer-Verlag, 1993.
14. T. Okamoto. An efficient divisible electronic cash scheme. In Advances in Cryptology - Proceedings of CRYPTO'91 (LNCS 963), pages 438-451. Springer-Verlag, 1995.
15. T. Okamoto. Threshold key-recovery system for RSA. In Proceedings of 1997 Security Protocols Workshop. Paris. April, 1997.
16. T. Pedersen. Distributed provers with applications to undeniable signatures. In Advances in Cryptology - Proceedings of EUROCRYPT'91 (LNCS 547), pages 221-242. Springer-Verlag, 1991.
17. T. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology - Proceedings of EUROCRYPT'91 (LNCS 547), pages 522-526. Springer-Verlag, 1991.
18. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - Proceedings of CRYPTO'91 (LNCS 576), pages 129-140. Springer-Verlag, 1992.
19. L.C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Advances in Cryptology - Proceedings of EUROCRYPT'88 (LNCS 330), pages 123-128. Springer-Verlag, 1988.
20. R.L. Rivest, A. Shamir and L.M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM v.21, n.2, 1978, pages 120-126.
21. M.O. Rabin. Digital signatures and public-key functions as intractable as factorization. MIT Laboratory for Computer Science, Technical Report, MIT/LCS/TR-212. 1979.
22. A. Shamir. How to share a secret. Communications of the ACM 22, 1979, pages 612-613.
23. CP. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):161-174, 1991.
24. M. Stadler. Publicly Verifiable Secret Sharing. In Advances in Cryptology - Proceedings of EUROCRYPT'96 (LNCS 1070), pages 190-199. Springer-Verlag, 1996.