<--- Back to Details
First PageDocument Content
Cryptography / Public-key cryptography / Homeomorphisms / Homomorphic encryption / Malleability / CramerShoup cryptosystem / Semantic security / Plaintext-aware encryption / ElGamal encryption / Cryptosystem / RSA / Random oracle
Date: 2012-05-30 08:51:39
Cryptography
Public-key cryptography
Homeomorphisms
Homomorphic encryption
Malleability
CramerShoup cryptosystem
Semantic security
Plaintext-aware encryption
ElGamal encryption
Cryptosystem
RSA
Random oracle

Simplified Submission of Inputs to Protocols Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. Consider an electronic election scheme implemented using a

Add to Reading List

Source URL: www.nada.kth.se

Download Document from Source Website

File Size: 268,75 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