Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University

First Page		Document Content
Date: 2011-01-14 14:00:36 Cryptographic 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 University Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 341,94 KB Share Document on Facebook

	Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer N, which we’ll assume for simplicity is a product of two primes \|and , this algorithm lets DocID: 1xVSj - View Document
	PDF Document DocID: 1xRwQ - View Document
	PDF Document DocID: 1xu6k - View Document
	PDF Document DocID: 1x9q3 - View Document
	PDF Document DocID: 1x1dn - View Document