Filters








1,669 Hits in 4.5 sec

Quantum Random Oracle Model for Quantum Public-Key Encryption

Tao Shang, Ranyiliu Chen, Qi Lei
2019 IEEE Access  
In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible random oracle for post-quantum cryptography and quantum random oracle for quantum  ...  To explore a feasible instantiation procedure in the quantum setting, we distinctively give two instantiation examples of QRO by means of single-qubit rotation and quantum fingerprinting, and compare the  ...  ) A valid instantiation of quantum random oracle model is given with security proofs.  ... 
doi:10.1109/access.2019.2940406 fatcat:ca4d4vj7vndpralluttw2jz5ha

Random Oracles in a Quantum World [article]

Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry
2012 arXiv   pre-print
We argue that to prove post-quantum security one needs to prove security in the quantum-accessible random oracle model where the adversary can query the random oracle with quantum states.  ...  We introduce the concept of a history-free reduction which is a category of classical random oracle reductions that basically determine oracle answers independently of the history of previous queries,  ...  Dan Boneh was supported by NSF, the Air Force Office of Scientific Research (AFO SR) under a MURI award, and by the Packard Foundation.  ... 
arXiv:1008.0931v2 fatcat:j6dgglfxtncsxhlnmwzwnrzkoa

Random Oracles in a Quantum World [chapter]

Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry
2011 Lecture Notes in Computer Science  
We argue that to prove post-quantum security one needs to prove security in the quantum-accessible random oracle model where the adversary can query the random oracle with quantum state.  ...  We introduce the concept of a history-free reduction which is a category of classical random oracle reductions that basically determine oracle answers independently of the history of previous queries,  ...  Dan Boneh was supported by NSF, the Air Force Office of Scientific Research (AFO SR) under a MURI award, and by the Packard Foundation.  ... 
doi:10.1007/978-3-642-25385-0_3 fatcat:vxobiu6twncctoke5ya3oyhg4i

The SPHINCS+ Signature Framework

Daniel J. Bernstein, Andreas Hülsing, Stefan Kölbl, Ruben Niederhagen, Joost Rijneveld, Peter Schwabe
2019 Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19  
One of our main contributions in this context is a new few-time signature scheme that we call FORS.  ...  For a much more detailed discussion of the choices, see [10] .  ...  Note that the restriction that A 1 does not get access to the random oracle is sufficient in later proofs, because when A 1 is implemented by a reduction, it will only use the function oracle to generate  ... 
doi:10.1145/3319535.3363229 dblp:conf/ccs/BernsteinHKNRS19 fatcat:izvoarblrjgndd7fzildws7gny

Adaptive versus Static Multi-oracle Algorithms, and Quantum Security of a Split-key PRF [article]

Jelle Don and Serge Fehr and Yu-Hsuan Huang
2022 arXiv   pre-print
In the second part of the paper, we use our compiler to show the security of the very efficient hash-based split-key PRF proposed by Giacon, Heuer and Poettering (PKC 2018), in the quantum random-oracle  ...  on previous oracle responses, into a static algorithm that fixes these choices at the beginning of the execution.  ...  YHH was funded by the Dutch Research Agenda (NWA) project HAPKIDO (project number NWA.1215.18.002), which is financed by the Dutch Research Council (NWO).  ... 
arXiv:2206.08132v3 fatcat:sugwmjpmsnac7bl4jyzqivjlgi

Uncloneable Decryptors from Quantum Copy-Protection [article]

Or Sattath, Shai Wyborski
2022 arXiv   pre-print
We show that our constructions could be instantiated relative to either the quantum oracle used in [Aar09] or the classical oracle used in (Aaronson et al., CRYPTO'21) to instantiate copy protection schemes  ...  We introduce a new notion of flip detection security for copy protection schemes inspired by the notions of left or right security for encryption schemes, and show that it could be used to instantiate  ...  impossible) in the quantum random oracle model.  ... 
arXiv:2203.05866v2 fatcat:drtko6yfyjaa5dytli3j6plwbe

Circuit-extension handshakes for Tor achieving forward secrecy in a quantum world

John M. Schanck, William Whyte, Zhenfei Zhang
2016 Proceedings on Privacy Enhancing Technologies  
We then prove that our new protocol, when instantiated with a post-quantum key encapsulation mechanism, achieves the stronger notion of transitional ACCE security.  ...  Finally, we instantiate our protocol with NTRU-Encrypt and provide a performance comparison between ntor, our proposal, and the recent design of Ghosh and Kate.  ...  Acknowledgements We are very grateful to Nick Mathewson and other members of the Tor community for their input on Tor proposal #263.  ... 
doi:10.1515/popets-2016-0037 dblp:journals/popets/SchanckWZ16 fatcat:eylhs2de3nbbhguptw5te376he

Making Existential-unforgeable Signatures Strongly Unforgeable in the Quantum Random-oracle Model

Edward Eaton, Fang Song, Marc Herbstritt
2015 Theory of Quantum Computation, Communication, and Cryptography  
We develop proof techniques such as adaptively programming a quantum random-oracle in a new setting, which could be of independent interest.  ...  Our main contribution is showing that the transformation also works against quantum adversaries in the quantum random-oracle model.  ...  EE was supported by NSERC on an undergraduate research award at the Institute for Quantum Computing, University of Waterloo. FS acknowledges support from NSERC, CryptoWorks21, ORF and US ARO.  ... 
doi:10.4230/lipics.tqc.2015.147 dblp:conf/tqc/EatonS15 fatcat:d75uy2jrvnbznjv66qopyjglki

Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model [article]

Edward Eaton, Fang Song
2015 arXiv   pre-print
We develop proof techniques such as adaptively programming a quantum random-oracle in a new setting, which could be of independent interest.  ...  Our main contribution is showing that the transformation also works against quantum adversaries in the quantum random-oracle model.  ...  EE was supported by NSERC on an undergraduate research award at the Institute for Quantum Computing, University of Waterloo. FS acknowledges support from NSERC, CryptoWorks21, ORF and US ARO.  ... 
arXiv:1509.02944v1 fatcat:4iykco52tffaxmjphsqchdblt4

The Fiat–Shamir Transformation in a Quantum World [chapter]

Özgür Dagdelen, Marc Fischlin, Tommaso Gagliardoni
2013 Lecture Notes in Computer Science  
(Asiacrypt 2011) has raised the issue that results in the random-oracle model may not be immediately applicable to quantum adversaries, because such adversaries should be allowed to query the random oracle  ...  The derived scheme is provably secure in the random-oracle model against classical adversaries.  ...  Marc Fischlin is supported by the Heisenberg grant Fi 940/3-1 of the German Research Foundation (DFG).  ... 
doi:10.1007/978-3-642-42045-0_4 fatcat:ev7yc3dabneltbnqrcwuuwzg4m

The Fiat-Shamir Transformation in a Quantum World [article]

Özgür Dagdelen, Marc Fischlin Tommaso Gagliardoni
2013 arXiv   pre-print
(Asiacrypt 2011) has raised the issue that results in the random-oracle model may not be immediately applicable to quantum adversaries, because such adversaries should be allowed to query the random oracle  ...  The derived scheme is provably secure in the random-oracle model against classical adversaries.  ...  Quantum Random Oracles We can now define the quantum random-oracle model by picking a random function H for a given domain and range, and letting (a subset of) the oracles Oi evaluate H on the input in  ... 
arXiv:1306.0315v1 fatcat:vny4yr7hifgkxp4sg4mdwvsegu

Quantum Equivalence of the DLP and CDHP for Group Actions [article]

Steven Galbraith, Lorenz Panny
2021 arXiv   pre-print
In this short note we give a polynomial-time quantum reduction from the vectorization problem (DLP) to the parallelization problem (CDHP) for group actions.  ...  Combined with the trivial reduction from par-allelization to vectorization, we thus prove the quantum equivalence of both problems.  ...  Given quantum access to a perfect parallelization oracle , one can construct a quantum algorithm for the vectorization problem that runs in polynomial time. Proof.  ... 
arXiv:1812.09116v2 fatcat:ebhr2hyukvgdvoiysh5z72kyk4

Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Kazuki Yoneyama
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
We propose a generic construction of AKE protocols from OW-CCA secure KEMs and prove CK + security of the protocols in the random oracle model.  ...  We exploit the random oracle and instantiate AKE protocols from various assumptions; DDH, gap DH, CDH, factoring, RSA, DCR, (ring-)LWE, McEliece one-way, NTRU one-way, subset sum, multi-variate quadratic  ...  In the real world, the random oracle is instantiated by a hash function H and a quantum adversary can evaluate on a quantum superposition of input.  ... 
doi:10.1145/2484313.2484323 dblp:conf/ccs/FujiokaSXY13 fatcat:jftnjbexxjf6dhgturlyqokl4m

An efficient post-quantum KEM from CSIDH

Mingping Qi
2022 Journal of Mathematical Cryptology  
in security since in the random oracle model, the security proof for CSIDH-ECIES-KEM needs to rely on the stronger CSI-GDH assumption, while the new CSIKE just needs to rely on the basic CSI-CDH assumption  ...  The famous SIKE is a post-quantum key encapsulation mechanism (KEM) constructed on the SIDH, motivated by which, this article presents a new post-quantum KEM-based on the CSIDH, which is thereby named  ...  This work was supported in part by the Natural Science Basic Research Program of Shaanxi Province of China under Grant 2021JQ-123 and in part by the Fundamental Research Funds for the Central Universities  ... 
doi:10.1515/jmc-2022-0007 fatcat:nhxaabuvj5cydhgchlspv6vsyq

A Note on Copy-Protection from Random Oracles [article]

Prabhanjan Ananth, Fatih Kaleoglu
2022 arXiv   pre-print
We present an impossibility result that rules out a class of copy-protection schemes in the random oracle model assuming the existence of quantum fully homomorphic encryption and quantum hardness of learning  ...  Since copy-protection is shown to be impossible to achieve in the plain model, we investigate the question of constructing copy-protection for arbitrary classes of unlearnable functions in the random oracle  ...  Simulate on-the-fly a classical random oracle O to be used in any of the steps below.  ... 
arXiv:2208.12884v1 fatcat:kqm43v3xubcgdngygftez6n22e
« Previous Showing results 1 — 15 out of 1,669 results