Results 31 to 40 of about 11,478 (298)
QuantumCommitting to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not changing it.
Lijie Chen, Ramis Movassagh
doaj +1 more source
Practically secure quantum position verification
New Journal of Physics, 2021 We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled
Siddhartha Das, George Siopsis
doaj +1 more source
A New Short Signature Scheme with Random Oracle from Bilinear Pairings
Journal of Telecommunications and Information Technology, 2023 In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function.
Sedat Akleylek +3 more
doaj +1 more source
Random Oracles in a Quantum World [PDF]
, 2011 The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle.
Dan Boneh +5 more
openaire +6 more sources
Non-Observable Quantum Random Oracle Model [PDF]
, 2023 The random oracle model (ROM), introduced by Bellare and Rogaway (CCS 1993), enables a formal security proof for many (efficient) cryptographic primitives and protocols, and has been quite impactful in practice. However, the security model also relies on
Varun Maram, Daniel Masny, Navid Alamati
core
Online-Extractability in the Quantum Random-Oracle Model [PDF]
, 2022 We show the following generic result: When a quantum query algorithm in the quantum random-oracle model outputs a classical value t that is promised to be in some tight relation with H(x) for some x, then x can be efficiently extracted with almost ...
Fehr, S. +5 more
core +4 more sources
Quantum query complexity of symmetric oracle problems [PDF]
Quantum, 2021 We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a $t$-query ...
Daniel Copeland, Jamie Pommersheim
doaj +1 more source
An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain
IEEE Access, 2018 Identity-based cryptosystems mean that public keys can be directly derived from user identifiers, such as telephone numbers, email addresses, and social insurance number, and so on.
Qun Lin +5 more
doaj +1 more source
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random Oracles with(out) Programmability [PDF]
, 2010 This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ideal hash function. This property is interesting for at least two reasons: first, because of its seeming artificiality (no standard model hash function is known to support such
Marc Fischlin +5 more
openaire +1 more source