Log in

Relevant bibliographies by topics / Quantum random oracle model

Contents

Journal articles

Academic literature on the topic 'Quantum random oracle model'

Author: Grafiati

Published: 21 September 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantum random oracle model.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Quantum random oracle model"

1

Zhandry, Mark. "Secure identity-based encryption in the quantum random oracle model." International Journal of Quantum Information 13, no. 04 (2015): 1550014. http://dx.doi.org/10.1142/s0219749915500148.

Full text

Abstract:

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 proofs for two random oracle hierarchical IBE schemes and a random oracle signature scheme, all of which have previously resisted quantum security proofs, even assuming quantum-secure PRFs. We also explain how to remove quantum-secure PRFs from p

APA, Harvard, Vancouver, ISO, and other styles

2

Shang, Tao, Ranyiliu Chen, and Qi Lei. "Quantum Random Oracle Model for Quantum Public-Key Encryption." IEEE Access 7 (2019): 130024–31. http://dx.doi.org/10.1109/access.2019.2940406.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Harrow, Aram W., and David J. Rosenbaum. "Uselessness for an Oracle model with internal randomness." Quantum Information and Computation 14, no. 7&8 (2014): 608–24. http://dx.doi.org/10.26421/qic14.7-8-5.

Full text

Abstract:

We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between classical and quantum query complexities can be constructed from much weaker separations. We also give conditions to determine when oracle problems -- either in the standard model, or in any of the generalizations we consider -- cannot be solved with s

APA, Harvard, Vancouver, ISO, and other styles

4

Gama, Mariana, Paulo Mateus, and André Souto. "A Private Quantum Bit String Commitment." Entropy 22, no. 3 (2020): 272. http://dx.doi.org/10.3390/e22030272.

Full text

Abstract:

We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message. Even though this property is not resilient against man-in-the-middle attacks, this threat can be circumvented by considering that the parties communicate through an authenticated channel. The protocol remains secure and private (but not composable) if we realize the random oracles as physical unclonable functions (PUFs) in the so-called bad PUF model.

APA, Harvard, Vancouver, ISO, and other styles

5

Goncalves, Brian, and Atefeh Mashatan. "Tightly Secure PKE Combiner in the Quantum Random Oracle Model." Cryptography 6, no. 2 (2022): 15. http://dx.doi.org/10.3390/cryptography6020015.

Full text

Abstract:

The development of increasingly sophisticated quantum computers poses a long-term threat to current cryptographic infrastructure. This has spurred research into both quantum-resistant algorithms and how to safely transition real-world implementations and protocols to quantum-resistant replacements. This transition is likely to be a gradual process due to both the complexity and cost associated with transitioning. One method to ease the transition is the use of classical–quantum hybrid schemes, which provide security against both classical and quantum adversaries. We present a new combiner for

APA, Harvard, Vancouver, ISO, and other styles

6

Banegas, Gustavo, Paulo S. L. M. Barreto, Brice Odilon Boidje, et al. "DAGS: Key encapsulation using dyadic GS codes." Journal of Mathematical Cryptology 12, no. 4 (2018): 221–39. http://dx.doi.org/10.1515/jmc-2018-0027.

Full text

Abstract:

Abstract Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes. The scheme is proved to be IND-CCA secure in both random oracle model and quantum random oracle model. We believe that DAGS will offer competitive performance, especially when compared with other existing code-based schemes, and represent a valid candidate for post-quantum standardization.

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Lijie, and Ramis Movassagh. "Quantum Merkle Trees." Quantum 8 (June 18, 2024): 1380. http://dx.doi.org/10.22331/q-2024-06-18-1380.

Full text

Abstract:

Committing 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. This information can be accessed by another party (typically called the verifier), who can later learn the information and verify that it was not meddled with. Merkle trees \cite{Merkle87} are a well-known construction for doing so in a succinct manner, in which the verifier can learn any part of the information by receiving a short proof from the honest prover. Despite its significance in classical crypto

APA, Harvard, Vancouver, ISO, and other styles

8

Kandii, S. O., and I. D. Gorbenko. "Analysis of DSTU 8961:2019 in the quantum random oracle model." Radiotekhnika, no. 214 (September 29, 2023): 7–16. http://dx.doi.org/10.30837/rt.2023.3.214.01.

Full text

Abstract:

Modern cryptographic transformations require provable security against a relatively wide class of threats. Typically, such evidentiary security is achieved through formal analysis within the chosen security model. The development of quantum computers led to the emergence of new attack vectors to which classical cryptography was vulnerable. However, there are cryptographic systems that are considered resistant to quantum attacks and some of them are even standardized. The formal analysis of such systems has faced difficulties for a long time, which were associated with the impossibility of appl

APA, Harvard, Vancouver, ISO, and other styles

9

Coladangelo, Andrea, Christian Majenz, and Alexander Poremba. "Quantum copy-protection of compute-and-compare programs in the quantum random oracle model." Quantum 8 (May 2, 2024): 1330. http://dx.doi.org/10.22331/q-2024-05-02-1330.

Full text

Abstract:

Copy-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. Aaronson (CCC 2009) initiated the formal study of quantum copy-protection schemes, and speculated that quantum cryptography could offer a solution to the problem thanks to the quantum no-cloning theorem. In this work, we introduce a quantum copy-protection scheme for a large class of evasive functions known as "compute-and-compare programs" – a more expressive generalization of point fu

APA, Harvard, Vancouver, ISO, and other styles

10

Yan, Jianhua, Licheng Wang, Lihua Wang, Yixian Yang, and Wenbin Yao. "Efficient Lattice-Based Signcryption in Standard Model." Mathematical Problems in Engineering 2013 (2013): 1–18. http://dx.doi.org/10.1155/2013/702539.

Full text

Abstract:

Signcryption is a cryptographic primitive that can perform digital signature and public encryption simultaneously at a significantly reduced cost. This advantage makes it highly useful in many applications. However, most existing signcryption schemes are seriously challenged by the booming of quantum computations. As an interesting stepping stone in the post-quantum cryptographic community, two lattice-based signcryption schemes were proposed recently. But both of them were merely proved to be secure in the random oracle models. Therefore, the main contribution of this paper is to propose a ne

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!