Revisiting Proxy Re-Encryption: Forward Secrecy, Improved Security, and Applications David Derler1 , Stephan Krenn2 , Thomas Lor¨ unser2 , Sebastian Ramacher1 , 2 Daniel Slamanig , and Christoph Striecks2

First Page		Document Content
Date: 2018-05-03 11:03:06 Cryptography Public-key cryptography Proxy re-encryption ID-based encryption Homomorphic encryption ElGamal encryption Chosen-ciphertext attack Encryption RSA Key Symmetric-key algorithm Identity-based conditional proxy re-encryption		Revisiting Proxy Re-Encryption: Forward Secrecy, Improved Security, and Applications David Derler1 , Stephan Krenn2 , Thomas Lor¨ unser2 , Sebastian Ramacher1 , 2 Daniel Slamanig , and Christoph Striecks2 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 571,65 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