Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS Seung Geol Choi∗ Jonathan Katz†

First Page		Document Content
Date: 2014-05-14 14:54:31 Ciphertext indistinguishability Oblivious transfer Computational indistinguishability Cryptographic hash function Chosen-ciphertext attack Zero-knowledge proof Diffie–Hellman problem RSA Cryptography Cryptographic protocols Common reference string model		Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS Seung Geol Choi∗ Jonathan Katz† Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 586,09 KB Share Document on Facebook

	The Twin Diffie-Hellman Problem and Applications David Cash1 Eike Kiltz2 Victor Shoup3 DocID: 1mLxm - View Document
	Motivation - Exotic Security Assumptions in Cryptography Main Algorithm and Results Oracle-assisted Static DHP for binary curves On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields DocID: 1miS9 - View Document
	1 On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol M ARZIA B USCEMI, University of Pisa DocID: 1lnSV - View Document
	THE RANDOM ORACLE MODEL: A TWENTY-YEAR RETROSPECTIVE NEAL KOBLITZ AND ALFRED J. MENEZES Abstract. It has been roughly two decades since the random oracle model for reductionist security arguments was introduced and one d DocID: 1gs9P - View Document
	Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, France DocID: 19uqQ - View Document