Cryptology ePrint Archive: Report 2018/958

On Tightly Secure Primitives in the Multi-Instance Setting

Dennis Hofheinz and Ngoc Khanh Nguyen

Abstract: We initiate the study of general tight reductions in cryptography. There already exist a variety of works that offer tight reductions for a number of cryptographic tasks, ranging from encryption and signature schemes to proof systems. However, our work is the first to provide a universal definition of a tight reduction (for arbitrary primitives), along with several observations and results concerning primitives for which tight reductions have not been known.

Technically, we start from the general notion of reductions due to Reingold, Trevisan, and Vadhan (TCC 2004), and equip it with a quantification of the respective reduction loss, and a canonical multi-instance extension to primitives. We then revisit several standard reductions whose tight security has not yet been considered. For instance, we revisit a generic construction of signature schemes from one-way functions, and show how to tighten the corresponding reduction by assuming collision-resistance from the used one-way function. We also obtain tightly secure pseudorandom generators (by using suitable rerandomisable hard-core predicates), and tightly secure lossy trapdoor functions.

Category / Keywords: foundations / Tight reductions, Primitives, Reductions, Provable Security

Original Publication (with minor differences): IACR-PKC-2019

Date: received 8 Oct 2018, last revised 9 Nov 2020

Contact author: nkn at zurich ibm com

Available format(s): PDF | BibTeX Citation

Version: 20201109:143837 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]