First Page | Document Content | |
---|---|---|
Date: 2011-01-14 14:00:36Cryptographic protocols Finite fields Diffie–Hellman problem Oblivious transfer RSA XTR Decisional Diffie–Hellman assumption Decision Linear assumption Diffie–Hellman key exchange Cryptography Public-key cryptography Computational hardness assumptions | Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins UniversityAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 341,94 KBShare Document on Facebook |
On the Feasibility of Extending Oblivious Transfer∗ Yehuda Lindell Hila Zarosim Dept. of Computer ScienceDocID: 1v80m - View Document | |
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer∗ Yehuda Lindell Hila ZarosimDocID: 1uUpb - View Document | |
INFOCOMMUNICATIONS JOURNAL Oblivious Transfer with Verification Oblivious ObliviousDocID: 1uO7u - View Document | |
Chemical OT: On the (Im)possibility of Basing Oblivious Transfer on Chemical Assump>ons Bernardo DavidDocID: 1tRD2 - View Document | |
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer∗ Yehuda Lindell† Benny Pinkas‡DocID: 1tjPL - View Document |