Ran Canetti
Uri Feige
Oded Goldreich
Moni Naor
- B.E. Bach, "How to generate factored random numbers", SIAM J. on Cornput., Vol. 17, No. 2, 1988, pp. 179-193. Google Scholar
Digital Library
- Be1.D. Beaver, "Foundations of Secure Interactive Computing", CRYPTO, 1991. Google ScholarDigital Library
- Be2.D. Beaver, "Adaptive Zero Knowledge and Computational Equivocation", these proceedings. Google ScholarDigital Library
- BH.D. Beaver and S. Haber, "Cryptographic Protocols Provably secure Against Dynamic Adversaries", Eurocrypt, 1992.Google Scholar
- BGW.M. Ben-Or, S. Goldwasser and A. Wigderson, "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation", 20th STOC, pp. 1-10, 1988. Google ScholarDigital Library
- BM.M. Blum, and S. Micali, "How to generate Cryptographically strong sequences of pseudo-random bits", SIAM J. on Computing, Vol. 13, 1984, pp. 850-864. Google ScholarDigital Library
- BCC.G. Brassard, D. Chaum and C. Crepeau, "Minimum Disclosure Proofs of Knowledge", JCSS, Vol. 37, No. 2, 1988, pp. 156-189. Google ScholarDigital Library
- C.R. Canetti, "Studies in Secure Multi-Party Computation and Applications", Ph.D. Thesis, Department of Computer Science and Applied Math, Weizmann Institute of Science, Rehovot, Israel, June 1995.Google Scholar
- CDNO.R. Canetti, C. Dwork, M. Naor and R. Ostrovsky, "Deniable Encryptions", manuscript.Google Scholar
- CFGN.R. Canetti, U. Feige, O. Goldreich and M. Naor, "Adaptively Secure Multi-party Computation", MIT LCS TR number 682, 1996. Google ScholarDigital Library
- CCD.D. Chaum, C. Crepeau and I Damgard, "Multi-party unconditionally secure protocols", 20th STOC, pp. 11-19, 1988. Google ScholarDigital Library
- DP.A. De-Santis and G. Persiano, "Zero-Knowledge proofs of knowledge without interaction", 33rd FOCS, pp. 427-436, 1992.Google ScholarDigital Library
- EGL.S. Even, O. Goldreich and A. Lempel, "A randomized protocol for signing contracts", CACM, vol. 28, No. 6, 1985, pp. 637-647. Google ScholarDigital Library
- F.P. Feldman, personal communication via Cynthia Dwork, 1988.Google Scholar
- GILVZ.O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan and D. Zuckerman, "Security Preserving Amplification of Hardness", 31st FOCS, i990, pp. 318-326.Google Scholar
- GrL.O. Goldreich and L. Levin, "A Hard-Core Predicate to any One-Way Function", 21st STOC, 1989, pp. 25-32. Google ScholarDigital Library
- GMW.O. Goldreich, S. Micali and A. Wigderson, "How to Play any Mental Game", 19th STOC, pp. 218-229, 1987. Google ScholarDigital Library
- GwL.S. Goldwasser and L. Levin, "Fair Computation of General Functions in Presence of Immoral Majority", CRYPTO, 1990. Google ScholarDigital Library
- MR.S. Micali and P. Rogaway, "Secure Computation", CRYPTO, 199 t.Google Scholar
- R.M. Rabin, "How to exchange secrets by oblivious transfer", Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981.Google Scholar
- RB.T. Rabin and M. Ben-Or, "Verifiable Secret Sharing and Multi-party Protocols with Honest Majority", 21st STOC, 1989, pp. 73-85. Google ScholarDigital Library
- RSA.R. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public Key Cryptosystems", CACM, Vol. 21, Feb. 1978, pp. 12o-126. Google ScholarDigital Library
- Y.A. Yao, "Theory and applications of trapdoor functions", 23rd FOCS, 1982, pp. 80-91.Google ScholarCross Ref
Index Terms
- Adaptively secure multi-party computation
Recommendations
Adaptively Secure Multi-Party Computation with Dishonest Majority
Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417Adaptively secure multiparty computation is an essential and fundamental notion in cryptography. In this work we focus on the basic question of constructing a multiparty computation protocol secure against a malicious, adaptive adversary in the stand-...
Adaptively Secure Two-Party Computation with Erasures
CT-RSA '09: Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in CryptologyIn the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (like privacy and correctness). An adaptively secure protocol is one in ...
Comments