Composability

Results: 80



#Item
41Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2008-12-21 16:22:00
42Cryptography for Secure and Private Databases: Enabling Practical Data Access without Compromising Privacy by Matthew Daniel Green

Cryptography for Secure and Private Databases: Enabling Practical Data Access without Compromising Privacy by Matthew Daniel Green

Add to Reading List

Source URL: spar.isi.jhu.edu

Language: English - Date: 2010-02-27 17:25:11
43Universally Composable Adaptive Oblivious Transfer Matthew Green Susan Hohenberger  Johns Hopkins University

Universally Composable Adaptive Oblivious Transfer Matthew Green Susan Hohenberger Johns Hopkins University

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-09-14 17:22:59
44An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Springer-Verlag, 2007. This is the full versio

An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Springer-Verlag, 2007. This is the full versio

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-05-02 11:56:16
45On Concurrently Secure Computation in the Multiple Ideal Query Model∗ Abhishek Jain‡ Vipul Goyal†

On Concurrently Secure Computation in the Multiple Ideal Query Model∗ Abhishek Jain‡ Vipul Goyal†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-07 10:35:40
46Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions Gilad Asharov∗ Amos Beimel†

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions Gilad Asharov∗ Amos Beimel†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-12-16 05:22:34
47Universally Composable and Forward Secure RFID Authentication and Authenticated Key Exchange Tri van Le, Mike Burmester, Breno de Medeiros Department of Computer Science, Florida State University Tallahassee, Florida, FL

Universally Composable and Forward Secure RFID Authentication and Authenticated Key Exchange Tri van Le, Mike Burmester, Breno de Medeiros Department of Computer Science, Florida State University Tallahassee, Florida, FL

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2006-12-05 18:44:49
48Secure Computation Without Authentication∗ Boaz Barak† Ran Canetti‡  Yehuda Lindell§

Secure Computation Without Authentication∗ Boaz Barak† Ran Canetti‡ Yehuda Lindell§

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-08-20 14:16:00
49Practical Yet Universally Composable Two-Server Password-Authenticated Secret Sharing∗ Jan Camenisch Anna Lysyanskaya

Practical Yet Universally Composable Two-Server Password-Authenticated Secret Sharing∗ Jan Camenisch Anna Lysyanskaya

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-21 10:51:23
50Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Juan A. Garay∗ Daniel Wichs†

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Juan A. Garay∗ Daniel Wichs†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-04-15 13:34:55