Efficient publicly verifiable secret sharing schemes with fast or delayed recovery

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

Volumn 1726, Issue , 1999, Pages 87-102

  Boudot, Fabrice ^a   Traoré, Jacques ^a  

^a ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; INFORMATION THEORY; SHAREHOLDERS;

COMPOSITE NUMBERS; DELAYED RECOVERIES; DISCRETE LOGARITHMS; FAST RECOVERY; INTEGER FACTORIZATION; PRIME FACTORS; PUBLICLY VERIFIABLE SECRET SHARING; SECRET SHARING SCHEMES;

RECOVERY;

EID: 84958664495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-47942-0_8     Document Type: Conference Paper

References (25)

1. M. Bellare and S. Goldwasser, Verifiable Partial Key Escrow, Proceedings of the Fourth Annual Conference on Computer and Communications Security, pp. 78-91, 1997.
2. F. Bao, An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms, to be published in the proceedings of CARDIS'98, 1998.
3. M. Bellare and P. Rogaway, Random Oracles are Practical: a Paradigm for Designing Efficient Protocols, Proceedings of the First Annual Conference and Communications Security, pp. 62-73, 1993.
4. D. Chaum, J.-H. Evertse and J. van de Graaf, An Improved Protocol for Demonstrating Possesion of Discrete Logarithm and Some Generalizations, Proceedings of EUROCRYPT'87, LNCS 304, pp. 127-141, 1988
5. A. Chan, Y. Frankel and Y. Tsiounis, Easy Come - Easy Go Divisible Cash, Proceedings of EUROCRYPT'98, LNCS Ц03, pp. 561-575, 1998.
6. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proceedings of FOCS, pp. 383-395, 1985.
7. D. Chaum and T.P. Pedersen, Wallet Databases with Observers, Proceedings of CRYPTO'92, LNCS 740, pp. 89-105, 1992.
8. C. Charnes, J. Pieprzyk and R. Safavi-Naini, Conditionally Secure Secret Sharing Scheme with Disenrolment Capability, Second ACM Conference on Computer and Communication Security, pp. 89-95, 1994.
9. P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, Proceedings of the 28th IEEE Symposium on FOCS, pp. 427437, 1987.
10. E. Fujisaki and T. Okamoto, A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications, Proceedings of EUROCRYPT'98, LNCS 1403, pp. 32-46, 1998.
11. A. Fiat and A. Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of CRYPTO'86, LNCS 263, pp. 186-194, 1986.
12. M. Girault, Self-Certified Public Keys, Proceedings of EUROCRYPT 91, LNCS 547, pp. 490-497, 1991.
13. J. van de Graaf and R. Peralta, A Simple and Secure Way to Show the Validity of Your Public Key, Proceedings of CRYPTO'87, LNCS 293, pp. 128-134, 1987.
14. W. Mao, Guaranteed Correct Sharing of Integer Factorization with Offline Shareholders, Proceedings of Public Key Cryptography 98, pp. 27-42, 1998.
15. S. Micali, Fair Public-Key Cryptosystems, Proceedings ofCRYPTO 92, LNCS 740, pp. 113-138, 1992.
16. G. Miller, Riemann's hypothesis and Tests for Primality, Journal of Computer and System Sciences (13), pp. 300-317, 1976.
17. U. Maurer and Y. Yacobi, Non-Interactive Public-Key Cryptography, Proceedings of EUROCRYPT'91, LNCS 547, pp. 498-507, 1991.
18. S.C. Pohlig and M. Hellman, An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance, Proceedings of IEEE Transactions on Information Theory, Vol. IT-24, pp. 106-110, 1978.
19. J.M. Pollard, Theorems on Factorization and Primality Testing, Proceedings of Cambridge Philos. Society, vol. 76, pp. 521-528, 1974
20. G. Poupard and J. Stern, Security Analysis of a Practical "on the fly" Authentication and Signature Generation, Proceedings of EUROCRYPT 98, LNCS 1403, pp. 422-436, 1998.
21. R. Rivest, A. Shamir and D. Wagner, Time-Lock Puzzles and Time-Release Crypto, this paper is available at http://theory.lcs.mit.edu/∼rivest/publications.html, to appear.
22. A. Shamir, How to Share a Secret, CACM, vol. 22, No. 11, pp. 612-613, 1979.
23. D. Shanks, Five Number-Theoric Algorithms, Proceedings of the 2nd Manitoba conference on numerical mathematics, pp. 51-70, 1972.
24. M. Stadler, Publicly Verifiable Secret Sharing, Proceedings of EU-ROCRYPT'96, LNCS 1070, pp. 190-199, 1996.
25. A. Young and M. Yung, Auto-Recoverable Auto-Certifiable Cryptosy-stems, Proceedings of EUROCRYPT'98, LNCS 1403, pp. 17-31, 1998.