Results 241 to 250 of about 14,997,530 (270)
Adaptive Proofs of Knowledge in the Random Oracle Model [PDF]
Lecture Notes in Computer Science, 2015 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.
Marc Fischlin +2 more
exaly +9 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Subquadratic SNARGs in the Random Oracle Model
Lecture Notes in Computer Science, 2021In a seminal work, Micali (FOCS 1994) gave the first succinct non-interactive argument (SNARG) in the random oracle model (ROM). The construction combines a PCP and a cryptographic commitment, and has several attractive features: it is plausibly post-quantum; it can be heuristically instantiated via lightweight cryptography; and it has a transparent ...
Eylon Yogev, Alessandro Chiesa
exaly +3 more sources
2021
In the previous chapter we looked at dedicated forms of hash functions that we categorized as non-cryptographic hash functions. Their common denominator is that we can prove the existence of constructions that fulfill the properties (e.g., pairwise independence) without having to rely on unproven assumptions.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
In the previous chapter we looked at dedicated forms of hash functions that we categorized as non-cryptographic hash functions. Their common denominator is that we can prove the existence of constructions that fulfill the properties (e.g., pairwise independence) without having to rely on unproven assumptions.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Time-Lock Puzzles in the Random Oracle Model [PDF]
Lecture Notes in Computer Science, 2011 A time-lock puzzle is a mechanism for sending messages "to the future". The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until enough time has elapsed for the puzzle to be solved. For time-lock puzzles to be useful, generating a puzzle should take less time than solving it. Since adversaries may have access to many
Mohammad Mahmoody, Salil Vadhan
exaly +3 more sources
Quantum Position Verification in the Random Oracle Model
Lecture Notes in Computer Science, 2014We present a quantum position verification scheme in the random oracle model. In contrast to prior work, our scheme does not require bounded storage/retrieval/entanglement assumptions. We also give an efficient position-based authentication protocol.
Dominique Unruh
exaly +4 more sources
Formal Indistinguishability Extended to the Random Oracle Model [PDF]
Lecture Notes in Computer Science, 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
Yassine Lakhnech
exaly +4 more sources
On the Security of NTS-KEM in the Quantum Random Oracle Model [PDF]
Lecture Notes in Computer Science, 2020 NTS-KEM is one of the 17 post-quantum public-key encryption (PKE) and key establishment schemes remaining in contention for standardization by NIST. It is a code-based cryptosystem that starts with a combination of the (weakly secure) McEliece and Niederreiter PKE schemes and applies a variant of the Fujisaki-Okamoto (Journal of Cryptology 2013) or ...
Varun Maram
exaly +5 more sources
On Deniability in the Common Reference String and Random Oracle Model [PDF]
Lecture Notes in Computer Science, 2003 We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntactically mimic the standard zero-knowledge definition, they loose some of its spirit. In particular, we show that there exist a specific natural security property that is not captured
Rafael Pass
exaly +3 more sources
Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model [PDF]
Lecture Notes in Computer Science, 2002 The generic group model has recently been used to prove the security of certain asymmetric encryption and signature schemes. This paper presents results that show that there exist problems in that are provably hard in the generic group model but easy to solve whenever the random encoding function is replaced with a specific encoding function (or one ...
exaly +3 more sources
Zero Knowledge in the Random Oracle Model, Revisited [PDF]
Lecture Notes in Computer Science, 2009 We revisit previous formulations of zero knowledge in the random oracle model due to Bellare and Rogaway (CCS '93) and Pass (Crypto '03), and present a hierarchy for zero knowledge that includes both of these formulations. The hierarchy relates to the programmability of the random oracle, previously studied by Nielsen (Crypto '02).
exaly +2 more sources