Lifting standard model reductions to common setup assumptions

DOI10.1007/978-3-030-97131-1_5MaRDI QIDQ6169031zbMATH OpenOpenAlexFDO

Authors Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi

Publication date 10 August 2023

Published in Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-97131-1_5

zbMATH Keywords

black-box reductionsideal cipher modelrandom oracle

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Notions of black-box reductions, revisited
• Theory of Cryptography
• Black-box reductions and separations in cryptography
• Theory of Cryptography
• Random Oracle Reducibility

Cites work

• Advances in Cryptology – CRYPTO 2004
• Analysis of information set decoding for a sub-linear error weight
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Breaking RSA may not be equivalent to factoring
• Communication Theory of Secrecy Systems*
• Decoding one out of many
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• scientific article; zbMATH DE number 4172375 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Information-set decoding for linear codes over F_q
• Notions of black-box reductions, revisited
• On quantum slide attacks
• On tightly secure primitives in the multi-instance setting
• One-Time Programs
• Probabilistic encryption
• Random oracles in a quantum world
• Random oracles with(out) programmability
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• Theory of Cryptography
• Transaction protection by beacons
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware

This page was built for publication: Lifting standard model reductions to common setup assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169031)