On the Impossibility of Tight Cryptographic Reductions Christoph Bader, Tibor Jager, Yong Li, and Sven Sch¨age Horst G¨ortz Institute for IT Security, Ruhr-University Bochum, Germany {christoph.bader, tibor.jager, yong

First Page		Document Content
Date: 2015-04-27 06:52:51 Public-key cryptography Digital signature Key management Notary Ciphertext indistinguishability Computational complexity theory Reduction Security parameter RSA Cryptography Theoretical computer science Applied mathematics		On the Impossibility of Tight Cryptographic Reductions Christoph Bader, Tibor Jager, Yong Li, and Sven Sch¨age Horst G¨ortz Institute for IT Security, Ruhr-University Bochum, Germany {christoph.bader, tibor.jager, yong Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 524,28 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document