Abstract
We present a very simple method for generating a shared pseudo-random function from a poly-random collection of functions. We discuss the applications of our construction to key escrow.
This research was performed while this author was at MIT, supported by a Fannie and John Hertz Foundation Fellowship for Graduate Study.
Chapter PDF
Similar content being viewed by others
Keywords
- Oblivious Transfer
- Annual IEEE Symposium
- 26th Annual IEEE Symposium
- Byzantine Agreement
- Verifiable Secret Sharing
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Awerbuch, M. Blum, B. Chor, S. Goldwasser, and S. Micali. How to implement Bracha’s O(lg n) Byzantine agreement algorithm. Submitted to 1985 Principles of Distributed Computing Conference.
M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security. ACM, 1993.
J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology— CRYPTO’ 88, pages 27–35. Springer-Verlag, 1988.
G. R. Blakley. Safeguarding cryptographic keys. In Proceedings of the AFIPS 1979 National Computer Conference, pages 313–317, June 1979. New York, NY.
M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. Siam Journal of Computing, 20(6):1084–1118, December 1991.
G. Bracha. An O(lg n) expected rounds randomized Byzantine generals protocol. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 316–326. ACM, 1985.
G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2):156–189, 1988.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pages 383–395. IEEE, 1985.
A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 522–533. ACM, 1994.
A. De Santis, S. Micali, and G. Persiano. Non-interactive zero-knowledge proof-systems. In Advances in Cryptology— CRYPTO’ 87, pages 52–72. Springer-Verlag, 1987.
D. Denning. To tap or not to tap. Communications of the ACM, 36(3):25–44, March 1993.
Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In Advances in Cryptology— CRYPTO’ 91, pages 457–469. Springer-Verlag, 1991.
Y. G. Desmedt. Threshold cryptography. European Transactions on Telecommunications and Related Technologies, 5(4):449–457, 1994.
U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2):77–94, 1988.
U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero-knowledge proofs based on a single random string. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 308–317. IEEE, 1990.
P. Feldman and S. Micali. Byzantine agreement in constant expected time (and trustine no one). In Proceedings of the 26th Annual IEEE Symposium on Foundatins of Computer Science, pages 267–276. IEEE, 1985.
A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology— CRYPTO’ 86, pages 186–194. Springer-Verlag, 1986.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792–807, October 1986.
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 on Foundations of Computer Science, pages 174–187. IEEE, 1986.
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 on Theory of Computing, pages 218–229. ACM, 1987.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the Association for Computing Machinery, 38(1):691–729, July 1991.
R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 12–24. ACM, 1989.
J. Kilian. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 20–31. ACM, 1988.
J. Kilian. Uses of Randomness in Algorithms and Protocols. ACM Distinguished Dissertations. MIT Press, 1990.
J. Kilian and T. Leighton. Failsafe key escrow. Technical Report TR-636, MIT, August 1994.
T. Leighton and S. Micali. Secret-key agreement without public-key cryptography. In Advances in Cryptology— CRYPTO’ 93, pages 456–479. Springer-Verlag, 1993.
L. Levin. One-way functions and pseudorandom generators. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 363–365. ACM, 1985.
S. Micali. Fair cryptosystems. Technical Report TR-579.b, MIT, November 1993.
National Institute for Standards and Technology. Escrowed Encryption Standard (EES), 1994. Federal Information Processing Standards Publication (FIPS PUB) 185.
A. Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, November 1979.
J. Spencer. Asymptotically good coverings. Pacific Journal of Mathematics, 118(2):575–586, 1985.
A. Yao. On the succession problem for Byzantine generals. Manuscript, Stanford University.
A. Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 162–167. IEEE, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Micali, S., Sidney, R. (1995). A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow Systems. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive