Results 11 to 20 of about 94,999 (279)
Delegating Quantum Computation in the Quantum Random Oracle Model [PDF]
, 2019 A delegation scheme allows a computationally weak client to use a server's resources to help it evaluate a complex circuit without leaking any information about the input (other than its length) to the server. In this paper, we consider delegation schemes for quantum circuits, where we try to minimize the quantum operations needed by the client.
Jiayu Zhang
core +5 more sources
Short Signatures in the Random Oracle Model [PDF]
, 2002 We study how digital signature schemes can generate signatures as short as possible, in particular in the case where partial message recovery is allowed. We give a concrete proposition named OPSSR that achieves the lower bound for message expansion, and give an exact security proof of the scheme in the ideal cipher model.
Louis Granboulan
openalex +2 more sources
Formal Indistinguishability Extended to the Random Oracle Model [PDF]
, 2009 Several generic constructions for transforming one-way func-tions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of their arguments. That is, given the image by a one-way function of a random value, an adversary has only negligible probability to compute this random value. Encryp-tion schemes must
Cristian Ene +2 more
openalex +5 more sources
Special Soundness in the Random Oracle Model
IACR Communications in CryptologyWe generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
Douglas Wikström
openalex +2 more sources
A Decentralized Signcryption Scheme Based on CFL [PDF]
SensorsThe rapid advancement of quantum computing technology poses a significant threat to conventional public key cryptographic infrastructure. The SM2 (state key cryptography algorithm no.
Leyi Shi, Mengting Liu
doaj +2 more sources
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model [PDF]
, 2015 Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature ...
Edward Eaton, Fang Song
openalex +6 more sources
Indifferentiable hash functions in the standard model
IET Information Security, 2021 Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
Tightly Secure PKE Combiner in the Quantum Random Oracle Model
Cryptography, 2022 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
Brian Goncalves, Atefeh Mashatan
doaj +1 more source
The Random Oracle Methodology, Revisited [PDF]
, 2000 We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".
Canetti, Ran +2 more
core +7 more sources