Results 1 to 10 of about 94,999 (279)
Adaptive proofs of knowledge in the random oracle model [PDF]
IET Information Security, 2016 The authors define a notion of adaptive proofs of knowledge (PoKs) in the random oracle model (ROM). These are proofs where the malicious prover can adaptively issue multiple statements and proofs, and where the extractor is supposed to extract a witness for each statement.
David Bernhard +2 more
core +9 more sources
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model [PDF]
International Journal of Electronics and Telecommunications, 2021 In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a ...
Mariusz Jurkiewicz
doaj +3 more sources
Quantum Random Oracle Model for Quantum Public-Key Encryption [PDF]
IEEE Access, 2019 Random oracle model is a general security analysis tool for rigorous security proof and effective cryptographic protocol design. In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible ...
Tao Shang, Ranyiliu Chen, Qi Lei
doaj +2 more sources
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]
QuantumCopy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting.
Andrea Coladangelo +2 more
doaj +2 more sources
Random Oracles in the Standard Model [PDF]
, 2016 Provable security is a fundamental concept of modern cryptography (see, e.g., Katz and Lindell; Introduction to Modern Cryptography, Chapter 1, 2007). In order to argue about security, we first require a precise and rigorous definition of what security means (e.g., a definition of secure encryption).
Arno Mittelbach
openalex +2 more sources
Double-sided: tight proofs for guessing games in the quantum random oracle model [PDF]
CybersecurityThe semi-classical One-Way to Hiding (SC-O2H) lemma given by Ambainis et al. (CRYPTO 2019) is a crucial technique to solve the reprogramming problem in the quantum random oracle model (QROM), which can lead to quadratically better bounds for many cases ...
Jiawei Bao, Jiangxia Ge, Rui Xue
doaj +2 more sources
Weakened Random Oracle Models with Target Prefix [PDF]
, 2019 Weakened random oracle models (WROMs) are variants of the random oracle model (ROM). The WROMs have the random oracle and the additional oracle which breaks some property of a hash function. Analyzing the security of cryptographic schemes in WROMs, we can specify the property of a hash function on which the security of cryptographic schemes depends ...
Masayuki Tezuka +2 more
openalex +4 more sources
Simulation-Based Secure Functional Encryption in the Random Oracle Model [PDF]
, 2015 One of the main lines of research in functional encryption FE has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. --- TCC'11, O'Neilli¾?--- ePrint'10] where it was first shown that for FE the indistinguishability-based IND security notion is not sufficient in the sense that there are ...
Vincenzo Iovino, Karol Żebroski
+6 more sources
Secure Identity-Based Encryption in the Quantum Random Oracle Model [PDF]
International Journal of Quantum Information, 2012 We give the first proof of security for an identity-based encryption (IBE) scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that does not rely on the assumed existence of so-called quantum-secure pseudorandom functions (PRFs). Our techniques are quite general and we use them to obtain security
Mark Zhandry
openalex +4 more sources
Pseudorandom Unitaries in the Haar Random Oracle Model [PDF]
66 ...
Prabhanjan Ananth +3 more
openalex +3 more sources