<--- Back to Details
First PageDocument Content
Cryptography / Functional encryption / RSA / Ciphertext indistinguishability
Date: 2017-09-07 14:53:41
Cryptography
Functional encryption
RSA
Ciphertext indistinguishability

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions Zvika Brakerski∗ Aayush Jain†

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 338,31 KB

Share Document on Facebook

Similar Documents

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

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