Resource fairness and composability of cryptographic protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3876 LNCS, Issue , 2006, Pages 404-428

  Garay, Juan ^a   MacKenzie, Philip ^b   Prabhakaran, Manoj ^c   Yang, Ke ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b GOOGLE INC   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTI-PARTY COMPUTATION; RESOURCE-FAIR PROTOCOLS; SIMULATION PARADIGM; UNIVERSAL COMPOSABILITY (UC);

COMPUTER SIMULATION; CRYPTOGRAPHY; MATHEMATICAL MODELS; RESOURCE ALLOCATION;

NETWORK PROTOCOLS;

EID: 33745536762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_21     Document Type: Conference Paper

References (59)

1. L. Adleman and K. Kompella. Using smoothness to achieve parallelism. In 20th STOC, pp. 528-538, 1988.
2. N. Asokan, V. Shoup, and M. Waidner. Optimistic Fair Exchange of Digital Signatures (Extended Abstract). In EUROCRYPT 1998, pp. 591-606, 1998.
3. M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In 1st Theory of Cryptography Conference (TCC), LNCS 2951, pp. 336-354, 2004.
4. D. Beaver and S. Goldwasser. Multiparty Computation with Faulty Majority. In 30th FOCS, pages 503-513, 1990.
5. J. Benaloh and M. de Mare. One-Way Accumulators: A Decentralized Alternative to Digital Signatures. In Eurocrypt 1993, LNCS 765, pp. 274-285, 1994.
6. M. Ben-Or, O. Goldreich, S. Micali and R. Rivest. A Fair Protocol for Signing Contracts. IEEE Transactions on Information Theory 36(1):40-46, 1990.
7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th STOC, pp. 1-10, 1988.
8. M. Blum. How to exchange (secret) keys. In ACM Transactions on Computer Systems, 1(2):175-193, May 1983.
9. L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on Computing, 15(2):364-383, May 1986.
10. D. Boneh. The decision Diffie-Hellman problem. In Proceedings of the Third Algorithmic Number Theory Symposium, LNCS 1423, pp. 48-63, 1998.
11. D. Boneh and M. Naor. Timed commitments (extended abstract). In Advances in Cryptology - CRYPTO '00, LNCS 1880, pp. 236-254, Springer-Verlag, 2000.
12. C. Cachin and J. Camenisch. Optimistic Fair Secure Computation. In Advances in Cryptology - CRYPTO '00, LNCS 1880, pp. 93-111, Springer-Verlag, 2000.
13. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, Winter 2000.
14. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) TR01-016, 2001.
15. Previous version "A unified framework for analyzing security of protocols" availabe at the ECCC archive TR01-016.
16. Extended abstract in FOCS 2001.
17. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067, 2005. Revised version of [14].
18. R. Canetti and M. Fischlin. Universally composable commitments. In CRYPTO 2001, LNCS 2139, pp. 19-40, 2001.
19. R. Canetti, Y. Lindeil, R. Ostrovsky, and A. Sahai. Universally Composable Two-party and Multi-party Secure Computation. In 34th STOC, 2002.
20. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th STOC, pp. 11-19, 1988.
21. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC 1986), pp. 364-369, 1986.
22. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. Ph.D. Thesis. CWI and University of Amsterdam, 1997.
23. R. Cramer, I. Damgård, and J. Nielsen. Multiparty Computation from Threshold Homomorphic Encryption In Advances in Cryptology - EuroCrypt 2001 Proceedings, LNCS 2045, pp. 280-300, Springer-Verlag, 2001.
24. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology CRYPTO '94, LNCS 839, pp. 174-187, 1994.
25. I. Damgård. Practical and Provably Secure Release of a Secret and Exchange of Signatures. In Journal of Cryptology 8(4), pp. 201-222, 1995.
26. I. Damgård and M. Jurik. Efficient protocols based probabilistic encryptions using composite degree residue classes. In Research Series RS-00-5, BRICS, Department of Computer Science, University of Aarhus, 2000.
27. I. Damgård, and J. Nielsen. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In Advances in Cryptology CRYPTO '03, 2003.
28. D. Dolev, C. Dwork and M. Naor. Non-malleable cryptography. SIAM J. on Comput., 30(2):391-437, 2000.
29. An earlier version appeared in 23rd ACM Symp. on Theory of Computing, pp. 542-552, 1991.
30. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Commun. ACM, 28(6):637-647, June 1985.
31. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein and A. Smith. Detectable Byzantine Agreement Tolerating Faulty Majorities (from scratch). In 21st PODC, pp. 118-126, 2002.
32. P. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Proceedings of Financial Crypto 2000, 2000.
33. Z. Galil, S. Haber, and M. Yung. Cryptographic Computation: Secure Fault-tolerant Protocols and the Public-Key Model. In CRYPTO'87, pp. 135-155, 1988.
34. J. Garay and M. Jakobsson. Timed Release of Standard Digital Signatures. In Financial Cryptography '02, LNCS 2357, pp. 168-182, Springer-Verlag, 2002.
35. J. Garay, P. MacKenzie, M. Prabhakaran and K. Yang. Resource Fairness and Composability of Cryptographic Protocols. In Cryptology ePrint Archive, http://eprint.iacr.org/2005/370.
36. J. Garay, P. MacKenzie and K. Yang. Strengthening Zero-Knowledge Protocols using Signatures. In Advances in Cryptology - Eurocrypt 2003, LNCS 2656, pp.177-194, 2003. Full version in Cryptology ePrint Archive, http://eprint.iacr.org/2003/037, 2003.
37. To appear in Journal of Cryptology.
38. J. Garay, P. MacKenzie and K. Yang. Efficient and Universally Composable Committed Oblivious Transfer and Applications. In 1st Theory of Cryptography Conference (TCC), LNCS 2951, pp. 297-316, 2004.
39. J. Garay, P. MacKenzie and K. Yang. Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. In Cryptology ePrint Archive, http://eprint.iacr.org/2004/019.
40. J. Garay and C. Pomerance. Timed Fair Exchange of Standard Signatures. In Financial Cryptography 2003, LNCS 2742, pp. 190-207, Springer-Verlag, 2003.
41. O. Goldreich. Secure Multi-Party Computation (Working Draft, Version 1.2), March 2000. Available from http://www.wisdom.weizmann.ac.il/~oded/pp.html.
42. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In 19th ACM Symposium on the Theory of Computing, pp. 218-229, 1987.
43. S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority, In CRYPTO '90, pp. 77-93, Springer-Verlag, 1991.
44. S. Goldwasser and Y. Lindell. Secure Computation Without Agreement. In Journal of Cryptology, 18(3), pp. 247-287, 2005.
45. D. Hofheinz and J. Müller-Quade. A Synchronous Model for Multi-Party Computation and Incompleteness of Oblivious Transfer. In Cryptology ePrint Archive, http://eprint.iacr.org/2004/016, 2004.
46. M. Lepinski, S. Micali, C. Peikert, and A. Shelat. Completely fair SFE and coalition-safe cheap talk. In 23rd PODC, pp. 1-10, 2004.
47. Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation.In FOCS 2003.
48. P. MacKenzie and K. Yang. On Simulation Sound Trapdoor Commitments. In Advances in Cryptology-Eurocrypt '04, pp.382-400, 2004.
49. J. B. Nielsen. On Protocol Security in the Cryptographi Model. Ph.D. Thesis. Aarhus University, 2003.
50. P. Paillier. Public-key cryptosystems based on composite degree residue classes. In Advances in Cryptology-Eurocrypt '99, pp.223-238, 1999.
51. T. P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology - CRYPTO '91, LNCS 576, 129-140, Springer-Verlag, 1991.
52. B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In ACM Conference on Computer and Communications Security (CSS), pp. 245-254, 2000.
53. B. Pinkas. Fair Secure Two-Party Computation. In Eurocrypt 2003, pp. 87-105, 2003.
54. M. Prabhakaran and A. Sahai. New notions of security: Achieving universal composability without trusted setup. Cryptology ePrint Archive, Report 2004/139. Extended abstract in Proc. 36th STOC, pp. 242-251, 2004.
55. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In 21st STOC, pp. 73-85, 1989.
56. V. Shoup. A Computational Introduction to Number Theory and Algebra. Preliminary book, available at http://shoup.net/ntb/.
57. J. Sorenson. A Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation. Available from http://citeseer.nj.nec.com/ sorenson99sublineartime.html.
58. A. Yao. Protocols for Secure Computation. In FOCS 1982, pp. 160-164, 1982.
59. A. Yao. How to generate and exchange secrets. In FOCS 1986, pp. 162-167, 1986.