Collusion-free multiparty computation in the mediated model

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

Volumn 5677 LNCS, Issue , 2009, Pages 524-540

  Alwen, Joël ^a   Katz, Jonathan ^b   Lindell, Yehuda ^c   Persiano, Giuseppe ^d   Shelat, Abhi ^e   Visconti, Ivan ^d  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

^d UNIVERSITY OF SALERNO   (Italy)

^e UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION MODELS; COVERT CHANNELS; MULTIPARTY COMPUTATION; ONE-WAY FUNCTIONS; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY; INFORMATION THEORY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 70350304833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_31     Document Type: Conference Paper

References (19)

1. Alwen, J., Shelat, A., Visconti, I.: Collusion-Free Protocols in the Mediated Model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 497-514. Springer, Heidelberg (2008)
2. Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure Computation without Authentication. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 361-377. Springer, Heidelberg (2005)
3. Bohli, J.M., Steinwandt, R.: On Subliminal Channels in Deterministic Signature Schemes. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 182-194. Springer, Heidelberg (2005)
4. Burmester, M., Desmedt, Y., Itoh, T., Sakurai, K., Shizuya, H., Yung, M.: A Progress Report on Subliminal-Free Channels. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 157-168. Springer, Heidelberg (1996)
5. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143-202 (2000)
6. Cramption, P., Schwartz, J.: Collusive Bidding: Lessons from the FCC Spectrum Auctions. Journal of Regulatory Economics 17(3), 229-252 (2000)
7. Desmedt, Y.: Simmons' Protocol is not Free of Subliminal Channels. In: IEEE Computer Security Foundations Workshop, pp. 170-175 (1996)
8. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
9. Hopper, N., Langford, J., von Ahn, L.: Provably Secure Steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77-92. Springer, Heidelberg (2002)
10. Izmalkov, S., Lepinski, M., Micali, S.: Verifiably Secure Devices. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 273-301. Springer, Heidelberg (2008)
11. Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Computation and Ideal Mechanism Design. In: Foundations of Computer Science (FOCS) 2005, pp. 585-595 (2005)
12. Lepinski, M., Micali, S., Shelat, A.: Fair Zero-Knowledge. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 245-263. Springer, Heidelberg (2005)
13. Lepinski, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: Symposium on Theory of Computing (STOC) 2005, pp. 543-552. ACM, New York (2005)
14. Lindell, Y.: Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. Chicago Journal of Theoretical Computer Science (1), 1-50 (2006)
15. Lindell, Y.: Lower Bounds and Impossibility Results for Concurrent Self Composition. Journal of Cryptology 21(2), 200-249 (2008)
16. Pass, R.: Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In: Symposium on Theory of Computing (STOC) 2004, pp. 232-241 (2004)
17. Simmons, G.: The Prisoners' Problem and the Subliminal Channel. In: Advances in Cryptology-Crypto 1983, pp. 51-67. Springer, Heidelberg (1983)
18. Simmons, G.: Cryptanalysis and Protocol Failures. Comm. ACM 37(11), 56-65 (1994)
19. Simmons, G.: The History of Subliminal Channels. In: Information Hiding Workshop, pp. 237-256 (1996)