This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Beaver: Foundations of Secure Interactive Computing, Proc. of Crypto 91.
L. Babai, A. Gál, J. Kollár, L. Rónyai, T. Szabó, A. Wigderson: Extremal Bipartite Graphs and Superpolynomial Lowerbounds for Monotone Span Programs, Proc. ACM STOC’ 96, pp. 603–611.
J. Benaloh, J. Leichter: Generalized Secret Sharing and Monotone Functions, Proc. of Crypto’ 88, Springer Verlag LNCS series, pp. 25–35.
M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. ACM STOC’ 88, pp. 1–10.
E. F. Brickell: Some Ideal Secret Sharing Schemes, J. Combin. Maths. & Combin. Comp. 9 (1989), pp. 105–113.
R. Canetti: Studies in Secure Multiparty Computation and Applications, Ph. D. thesis, Weizmann Institute of Science, 1995. (Better version available from Theory of Cryptography Library).
R. Canetti, U. Fiege, O. Goldreich and M. Naor: Adaptively Secure Computation, Proceedings of STOC 1996.
R. Canetti: Universally Composable Security, The Eprint archive, www.iacr.org.
R. Canetti, U. Feige, O. Goldreich, M. Naor: Adaptively Secure Multi-Party Computation, Proc. ACM STOC’ 96, pp. 639–648.
D. Chaum, C. Crépeau, I. Damgård: Multi-Party Unconditionally Secure Protocols, Proc. of ACM STOC’ 88, pp. 11–19.
R. Cramer, I. Damgård: Zero Knowledge for Finite Field Arithmetic or: Can Zero Knowledge be for Free?, Proc. of CRYPTO’98, Springer Verlag LNCS series.
R. Cramer, I. Damgård, S. Dziembowski, M: Hirt and T. Rabin: Efficient Multiparty Computations With Dishonest Minority, Proceedings of EuroCrypt 99, Springer Verlag LNCS series.
R. Cramer, I. Damgård and U. Maurer: Multiparty Computations from Any Linear Secret Sharing Scheme. In: Proc. EUROCRYPT’ 00.
R. Cramer. Introduction to Secure Computation. Latest version: January 2001. Available from http://www.brics.dk/~cramer
C. Crepeau, J. vd.Graaf and A. Tapp: Committed Oblivious Transfer and Private Multiparty Computation, Proc. of Crypto 95, Springer Verlag LNCS series.
D. Dolev, C. Dwork, and M. Naor, Non-malleable cryptography, Proc. ACM STOC’ 91, pp. 542–552.
I. Damgård and J. Nielsen: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption, Proc. of Crypto 2003, Springer Verlag LNCS.
M. Fitzi, U. Maurer: Efficient Byzantine agreement secure against general adversaries, Proc. Distributed Computing DISC’ 98.
R. Gennaro, M. Rabin, T. Rabin, Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography, in Proc of ACM PODC’98, pp. 101–111.
O. Goldreich, S. Micali and A. Wigderson: How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority, Proc. of ACM STOC’ 87, pp. 218–229.
M. Hirt, U. Maurer: Complete Characterization of Adversaries Tolerable in General Multiparty Computations, Proc. ACM PODC’97, pp. 25–34.
M. Karchmer, A. Wigderson: On Span Programs, Proc. of Structure in Complexity, 1993.
J. Kilian: Founding Cryptography on Oblivious Transfer, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 20–31, Chicago, Illinois, 2–4 May 1988.
S. Micali and P. Rogaway: Secure Computation, Manuscript, Preliminary version in Proceedings of Crypto 91.
Nielsen: Protocol Security in the Cryptographic Model, PhD thesis, Dept. of Comp. Science, Aarhus University, 2003.
T. P. Pedersen: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Proc. CRYPTO’ 91, Springer Verlag LNCS, vol. 576, pp. 129–140.
P. Pudlák, J. Sgall: Algebraic Models of Computation and Interpolation for Algebraic Proof Systems Proc. Feasible Arithmetic and Proof Complexity, Springer Verlag LNCS series.
T. Rabin: Robust Sharing of Secrets when the Dealer is Honest or Cheating, J. ACM, 41(6):1089–1109, November 1994.
T. Rabin, M. Ben-Or: Verifiable Secret Sharing and Multiparty Protocols with Honest majority, Proc. ACM STOC’ 89, pp. 73–85.
A. Shamir: How to Share a Secret, Communications of the ACM 22 (1979) 612–613.
M. van Dijk: Secret Key Sharing and Secret Key Generation, Ph.D. Thesis, Eindhoven University of Technology, 1997.
Rights and permissions
Copyright information
© 2005 Birkhäuser Verlag
About this chapter
Cite this chapter
Cramer, R., Damgård, I. (2005). Multiparty Computation, an Introduction. In: Contemporary Cryptology. Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser Basel. https://doi.org/10.1007/3-7643-7394-6_2
Download citation
DOI: https://doi.org/10.1007/3-7643-7394-6_2
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7294-1
Online ISBN: 978-3-7643-7394-8
eBook Packages: Computer ScienceComputer Science (R0)