Results 251 to 260 of about 14,997,530 (270)
Some of the next articles are maybe not open access.
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 +3 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 +3 more sources
Securing “Encryption + Proof of Knowledge” in the Random Oracle Model
2002To create encryption schemes that offer security against adaptive chosen ciphertext attacks, this paper shows how to securely combine a simple encryption scheme with a proof of knowledge made noninteractive with a hash function. A typical example would be combining the ElGamal encryption scheme with the Schnorr signature scheme.
openaire +2 more sources
Multi-Source Randomness Extraction and Generation in the Random-Oracle Model.
IACR Cryptol. ePrint Arch.We study the multi-source randomness extraction and generation properties of the monolithic random oracle (RO), whereby one is tasked with extracting or generating uniform random bits from multiple unpredictable sources. We formalize this problem according to the query complexities of the involved parties - sources, distinguishers, and predictors ...
Coretti, Sandro +3 more
openaire +3 more sources
Lower Bound on SNARGs in the Random Oracle Model
2022Iftach Haitner +2 more
openaire +2 more sources