Composability

Results: 80



#Item
31A Probabilistic Analysis of Onion Routing in a Black-box Model JOAN FEIGENBAUM, Yale University AARON JOHNSON, U.S. Naval Research Laboratory PAUL SYVERSON, U.S. Naval Research Laboratory

A Probabilistic Analysis of Onion Routing in a Black-box Model JOAN FEIGENBAUM, Yale University AARON JOHNSON, U.S. Naval Research Laboratory PAUL SYVERSON, U.S. Naval Research Laboratory

Add to Reading List

Source URL: www.ohmygodel.com

Language: English - Date: 2012-07-09 20:58:21
32Provably Secure and Practical Onion Routing Michael Backes Ian Goldberg  Saarland University and MPI-SWS, Germany

Provably Secure and Practical Onion Routing Michael Backes Ian Goldberg Saarland University and MPI-SWS, Germany

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-03-20 11:08:29
33Provably Secure and Practical Onion Routing Michael Backes Ian Goldberg Aniket Kate Esfandiar Mohammadi Saarland University and MPI-SWS University of Waterloo

Provably Secure and Practical Onion Routing Michael Backes Ian Goldberg Aniket Kate Esfandiar Mohammadi Saarland University and MPI-SWS University of Waterloo

Add to Reading List

Source URL: www.cypherpunks.ca

Language: English - Date: 2012-04-29 17:48:07
34Universally Composable Security: A New Paradigm for Cryptographic Protocols∗ Ran Canetti† July 16, 2013  Abstract

Universally Composable Security: A New Paradigm for Cryptographic Protocols∗ Ran Canetti† July 16, 2013 Abstract

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-07-16 22:00:04
35Information-Theoretically Secure Protocols and Security Under Composition∗ Eyal Kushilevitz† Department of Computer Science Technion Israel Institute of Technology Haifa 32000, Israel.

Information-Theoretically Secure Protocols and Security Under Composition∗ Eyal Kushilevitz† Department of Computer Science Technion Israel Institute of Technology Haifa 32000, Israel.

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-12-20 09:14:45
36Games and the Impossibility of Realizable Ideal Functionality Anupam Datta1 , Ante Derek1 , John C. Mitchell1 , Ajith Ramanathan1 , and Andre Scedrov2 1

Games and the Impossibility of Realizable Ideal Functionality Anupam Datta1 , Ante Derek1 , John C. Mitchell1 , Ajith Ramanathan1 , and Andre Scedrov2 1

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2007-12-18 01:29:59
37An Equational Approach to Secure Multi-party Computation∗ Daniele Micciancio† Stefano Tessaro‡  January 12, 2013

An Equational Approach to Secure Multi-party Computation∗ Daniele Micciancio† Stefano Tessaro‡ January 12, 2013

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2013-09-26 16:14:53
38Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model Yehuda Lindell∗ Department of Computer Science Bar-Ilan University Ramat Gan, 52900, Israel

Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model Yehuda Lindell∗ Department of Computer Science Bar-Ilan University Ramat Gan, 52900, Israel

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2006-10-01 16:24:33
39Horizontal composability revisited? Donald Sannella1 and Andrzej Tarlecki2,3 1 Laboratory for Foundations of Computer Science, University of Edinburgh 2

Horizontal composability revisited? Donald Sannella1 and Andrzej Tarlecki2,3 1 Laboratory for Foundations of Computer Science, University of Edinburgh 2

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2006-03-25 10:02:21
40Legally Enforceable Fairness in Secure Two-Party Computation∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Legally Enforceable Fairness in Secure Two-Party Computation∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2009-07-16 07:03:28