Distributed pseudo-random functions and KDCs

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

Volumn 1592, Issue , 1999, Pages 327-346

  Naor, Moni ^a   Pinkas, Benny ^a   Reingold, Omer ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

KEY DISTRIBUTION CENTERS; MULTICAST GROUPS; PSEUDO-RANDOM FUNCTIONS; RANDOM FUNCTIONS; SINGLE POINT;

CRYPTOGRAPHY;

EID: 84957653598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_23     Document Type: Conference Paper

References (44)

1. Aho A. V., Hopcroft J. E. and Ullman J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. Bach E. and Shallit J., Algorithmic Number Theory, vol. 1: Efficient Algorithms, The MIT Press, 1996, pp. 155-163.
3. Beimel A., “Secure schemes for secret sharing and key distribution", DScdissertation, 1996.
4. Bellare M. and Rogaway P., “Provably secure session key distribution - the three party case", 27th Proc. ACM Symp. on Theory of Computing, (1995), 57-66.
5. Bellare M. and Rogaway P., Random oracles are practical: A paradigm for designing efficient protocols, Proc. 1st Conf. on Computer and Communications Security, ACM, 1993, pp. 62-73.
6. BenOr M., Goldwasser S. and Wigderson A., Completeness theorems for non cryptographic fault tolerant distributed computation, 20th Proc. ACM Symp. On Theory of Computing, (1988), 1-9.
7. Benaloh J. and Rudich S., private communication, 1989.
8. Blaze M,, Feigenbaum J. and Naor M., “A Formal Treatment of Remotely Keyed Encryption", Advances in Cryptology - Eurocrypt'98, LNCS 1403, Springer-Verlag, 1998, pp. 251-265.
9. D. Boneh, “The Decision DifieHellman Problem", Proc. of the Third Algorithmic Number Theory Symp., LNCS Vol. 1423, Springer-Verlag, pp. 48-63, 1998.
10. Canetti R., Towards realizing random oracles: hash functions that hide all partial information, CRYPTO '97, LNCS, Springer, 1997, pp. 455-469.
11. Canetti R., Gennaro R., Herzberg D. and Naor D., “Proactive Security: Long-term protection against break-ins", CryptoBytes.
12. R. Canetti, O. Goldreich and S. Halevi, The random oracle model, revisited, to appear in: Proc. 30th Ann. ACM Symp. on Theory of Computing, 1998.
13. Canetti R. and Goldwasser S., “An efficient threshold public-key cryptosystem secure against chosen ciphertext attack", Advances in Cryptology - Eurocrypt '99, Springer-Verlag, 1999.
14. Chaum D., Crepeau C. and Damgard I., Multiparty unconditionally secure protocols, 20th Proc. ACM Symp. on Theory of Computing, (1988), 11-19.
15. Chaum D. and Van Antwerpen H., “Undeniable signatures", Advances in CryptologyCrypto '89, Springer-Verlag LNCS 435, (1990), 212-217.
16. Cramer R., Damgard I. and Maurer U., “General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme", manuscript, 1999.
17. DeSantis A., Desmedt Y., Frankel Y., and Yung M., “How to share a function securely", in Proc. 26th STOC, 1994, pp. 522-533
18. Desmedt Y. and Frankel Y., “Threshold cryptosystems", Advances in CryptologyCrypto '89, Springer-Verlag LNCS 435, (1989), 307-315.
19. Dolev D., Dwork C., Waarts O. and Yung M., “Perfectly secure message transmission", JACM 40(1):17-47, 1993.
20. Feldman P. and S. Micali, “An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement", Siam J. Comp. 26, 1997, pp. 873-933.
21. Gemmell P., “An introduction to threshold cryptography", CryptoBytes, Winter 97, 7-12, 1997.
22. Gennaro R., Jarecki S., Krawczyk H. and Rabin T., “Robust threshold DSS signatures", Adv. in CryptologyEurocrypt '96, Springer-Verlag, LNCS 1070, 354-371.
23. Goldreich O., “Foundations of Cryptography" (fragments of a book), 1995.
24. Goldreich O., Goldwasser S. and Micali S., “How to construct random functions", J. of the ACM, Vol. 33, No. 4, (1986), 691-729.
25. Goldreich O., Micali S. and Wigderson A., “How to play any mental game", 19th Proc. ACM Symp. on Theory of Computing, (1987), 218-229.
26. Gong L., “Increasing availability and security of an authentication service", IEEE J. SAC, Vol. 11, No. 5, (1993), 657-662.
27. Kaufmaan C., Perlman R., and Speciner M., Network Security, Prentice Hall, 1995.
28. Karchmer M. and Wigderson A., “On span programs", Proc. 8th Structures in Complexity Theory conf., 102-111, 1993.
29. Luby M., Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.
30. McEliece R. J. and Sarwate D. V., “On sharing secrets and Reed-Solomon Codes", Comm. ACM, Vol. 24, No. 9, 1981, 583-584.
31. Micali S. and Sidney R., “A simple method for generating and sharing pseudo- random functions, with applications to clipper-like key escrow systems", Adv. In Cryptology - Crypto '95, Springer, 185-196.
32. Naor M. and Pinkas B., Secure and efficient metering, Advances in Cryptology - Eurocrypt '98, LNCS 1403, Springer-Verlag, 1998, pp. 576-590.
33. M. Naor and B. Pinkas, “Oblivious Transfer and Polynomial Evaluation", Proc. 31th Ann. ACM Symp. on Theory of Computing, 1998.
34. Naor M. and Pinkas B., Maintaining secure communication in networks for long terms, manuscript, 1999.
35. Naor M. and O. Reingold, “Synthesizers and their application to the parallel construction of pseudo-random functions", Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 170-181.
36. Naor M. and Reingold O., “Number-Theoretic constructions of efficient pseudo- random functions", Proc. 38th IEEE FOCS, 1997.
37. Naor M. and O. Reingold, “From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs", Advances in CryptologyCRYPTO '98, 1998, pp. 267-282.
38. Naor M. and Wool A., “The load, capacity, and availability of quorum systems", SIAM J. Comput., Vol. 27, No. 2, 423-447, April 1998.
39. Naor M. and Wool A., “Access Control and Signatures via Quorum Secret Sharing", 3rd ACM Conf. of Computer and Communication Security, 1996, 157-168.
40. Needham R. and Schroeder M., “Using encryption for authentication in large net- works of computers", Comm. ACM, Vol. 21, No. 12, 993-999, December 1978.
41. Rabin M. O., “Transaction Protection by Beacons", JCSS, Vol. 27, No. 2, (1983), 256-267.
42. Rabin T., “A Simpliffied Approach to Threshold and Proactive RSA", Advances in Cryptology - CRYPTO '98, 1998, pp. 89-104.
43. Schnorr C. P., Efficient identiffication and signatures for smart cards, Proc. Advances in Cryptology - CRYPTO '89, LNCS, Springer-Verlag, 1990, pp. 239-252.
44. Shamir A., “How to share a secret", Comm. ACM Vol. 22, No. 11 (Nov. 1979), 612-613.