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 - Computational indistinguishability - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2015-04-27 06:52:51 Open Document File Size: 524,28 KB Share Result on Facebook / Facility University Bochum / Sven Sch¨age Horst G¨ortz Institute / / IndustryTerm limited applications / derivation algorithm / candidate solution / non-interactive key exchange protocols / correct solution / exhaustive search / theoretical search / / Organization Sven Sch¨age Horst G¨ortz Institute for IT Security / / Person Tibor Jager / A. Ideally / Yong Li / Christoph Bader / Sven Sch / / Position standard IND-CPA / / Technology encryption / cryptography / non-interactive key exchange protocols / secret key / simulation / public key / digital signature / public-key encryption / key exchange protocols / key derivation algorithm / hierarchical identity-based encryption / / SocialTag Public-key cryptography Digital signature Key management Notary Ciphertext indistinguishability Computational complexity theory Reduction Security parameter RSA Cryptography

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, yongAdd to Reading List