Results 191 to 200 of about 5,964 (223)
Some of the next articles are maybe not open access.
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
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, Unruh Dominique
exaly +3 more sources
The random oracle model: a twenty-year retrospective [PDF]
Designs, Codes, and Cryptography, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neal Koblitz +2 more
exaly +3 more sources
Succinct Arguments in the Quantum Random Oracle Model
Lecture Notes in Computer Science, 2019Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership in non-deterministic languages. Constructions of SNARGs in the random oracle model are widely believed to be post-quantum secure, provided the oracle is instantiated with a suitable post-quantum hash function. No formal evidence, however, supports this belief.
Alessandro Chiesa +2 more
exaly +3 more sources
Subquadratic SNARGs in the Random Oracle Model
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 ...
Alessandro Chiesa, Eylon Yogev
openaire +2 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).
Hoeteck Wee, Wee Hoeteck
exaly +2 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, Pass Rafael
exaly +2 more sources
Revisiting TESLA in the Quantum Random Oracle Model
2017We study a scheme of Bai and Galbraith (CT-RSA’14), also known as TESLA. TESLA was thought to have a tight security reduction from the learning with errors problem (LWE) in the random oracle model (ROM). Moreover, a variant using chameleon hash functions was lifted to the quantum random oracle model (QROM).
Erdem Alkim +7 more
openaire +3 more sources
Random Oracles in the Standard Model
2016Provable 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).
openaire +2 more sources
Barriers for Succinct Arguments in the Random Oracle Model
2020We establish barriers on the efficiency of succinct arguments in the random oracle model. We give evidence that, under standard complexity assumptions, there do not exist succinct arguments where the argument verifier makes a small number of queries to the random oracle.
Alessandro Chiesa, Eylon Yogev
openaire +2 more sources