Oded Goldreich
Silvio Micali
- [Ba] D. Barrington, Bounded-Width Branching Programs Recognize Exactly Those Languages in NC1, Proc. 18th STOC, 1986 pp 1--5Google Scholar
- [B1] M. Blum, Coin Flipping by Telephone, IEEE COMPCON 1982, pp. 133--137.Google Scholar
- [BH] R. Boppana and R. Hirschfeld, Pseudo-Random Generatora and Complexity Classes, To appear in Randomness and Computation, 5th volume of Advances in Computing Research, ed. S. MicaliGoogle Scholar
- [BM] M. Blum and S. Micali, How To Generate Sequences Of Cryptographically Strong Pseudo-Random Bits, SIAM J. on Computing, Vol. 13, Nov 1984, pp. 850--864Google ScholarDigital Library
- [CG] B. Chor and O. Goldreich, RSA/Rabin Bits Are 1/2 + 1/poly(logN) Secure, To appear SIAM J. on Computing. Earlier version in Proc. FOCS 1984, pp. 449--463Google Scholar
- [CGMA] B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults', Proc. 26th FOCS, 1985, pp. 383--395Google ScholarDigital Library
- [EGL] S. Even, O. Goldreich, and A. Lempel, A Randomized Protocol for Signing Contracts, CACM, vol. 28, No. 6, 1985, pp. 637--647Google ScholarDigital Library
- [FMRW] M. Fischer, S. Micali, C. Rackoff and D. Witenberg, A Secure Protocol for the Oblivious Transfer, In preperation 1986.Google Scholar
- [GM] S. Goldwasser, and S. Micali, Probabilistic Encryption, JCSS Vol. 28, No. 2, April 1984. An earlier version (containing other results) was titled Probabilistic Encryption and How to Play Mental Poker Hideing Ail Partial Information,Google Scholar
- [GMR] S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, To appear SIAM J. on Computing (manuscript available from authors). Earlier version in Proc. 17th Annual ACM Symp. on Theory of Computing, pp 291--304.Google Scholar
- [GoMiRi] S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive, Chosen Cyphertezt Attack To appear in SLAM J. on Computing (available from authors) Earlier version, titled "A Paradoxical Solution to the Signature Problem, in Proc. 25th FOCS, 1984, pp. 441--448Google Scholar
- [GMW] O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proc. of FOCS 1986.Google ScholarDigital Library
- [HR] J. Halpern and M.O. Rabin, A Logic to reason about likehood, Proc. of 15th STOC, 1983.Google Scholar
- [L] L. Leonid, One-Way Functions and PseudO-Random Generators, Proc. 17th STOC, 1985, pp. 363--365Google Scholar
- [Y] A.Yao, Theory and Application of Trapdoor Functions, Proc. of 23rd FOCS, IEEE, Nov., 1982, pp. 80--91.Google Scholar
- [Y2] A.Yao, How to Generate and Exchange Secrets, Proc. 27th STOC, 1986, pp. 162--167Google Scholar
Index Terms
- How to play any mental game, or a completeness theorem for protocols with honest majority
Index terms have been assigned to the content through auto-classification.
Recommendations
Protocols for Multiparty Coin Toss with a Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution, although some corrupted parties might try to bias the output. These protocols are used as a building block in many cryptographic protocols. Cleve (Proc. of the ...
1/p-Secure multiparty computation without honest majority and the best of both worlds
CRYPTO'11: Proceedings of the 31st annual conference on Advances in cryptologyA protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In ...
Identifying cheaters without an honest majority
TCC'12: Proceedings of the 9th international conference on Theory of CryptographyMotivated by problems in secure multiparty computation (MPC), we study a natural extension of identifiable secret sharing to the case where an arbitrary number of players may be corrupted. An identifiable secret sharing scheme is a secret sharing scheme ...
Comments