Results 211 to 220 of about 6,034 (237)
Some of the next articles are maybe not open access.
Non-Observable Quantum Random Oracle Model
Lecture Notes in Computer Science, 2023Varun Maram +2 more
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
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
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
2010
The signature schemes described in the previous chapters, whether based on the RSA/strong RSA assumptions or bilinear maps, represent essentially the extent of what is currently known regarding efficient yet provably secure signature schemes.
openaire +1 more source
The signature schemes described in the previous chapters, whether based on the RSA/strong RSA assumptions or bilinear maps, represent essentially the extent of what is currently known regarding efficient yet provably secure signature schemes.
openaire +1 more source
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
Quantum Random Oracle Model with Auxiliary Input
2019The random oracle model (ROM) is an idealized model where hash functions are modeled as random functions that are only accessible as oracles. Although the ROM has been used for proving many cryptographic schemes, it has (at least) two problems. First, the ROM does not capture quantum adversaries. Second, it does not capture non-uniform adversaries that
Minki Hhan +2 more
openaire +2 more sources
Combining Encryption and Proof of Knowledge in the Random Oracle Model
The Computer Journal, 2004Summary: This paper proposes a generic construction that yields encryption schemes that are secure against adaptive chosen ciphertext attacks. In particular, we focus on combining weak encryption schemes with proofs of knowledge made non-interactive through the use of a hash function. This type of conversion yields encryption schemes that allow anybody
openaire +2 more sources