Beaver, Donald Correlated pseudorandomness and the complexity of private computations. (English) Zbl 0917.94012 Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22–24, 1996. New York, NY: ACM, 479-488 (1996). Cited in 2 ReviewsCited in 22 Documents MSC: 94A60 Cryptography 68Q25 Analysis of algorithms and problem complexity 68P25 Data encryption (aspects in computer science) Keywords:cryptographic primitives; obvious transfer; random number generation; one-way function; complexity; complete Boolean function Citations:Zbl 0718.68042 PDF BibTeX XML Cite \textit{D. Beaver}, in: Proceedings of the 28th annual ACM symposium on the theory of computing, STOC '96. Philadelphia, PA, USA, May 22--24, 1996. New York, NY: ACM. 479--488 (1996; Zbl 0917.94012) OpenURL