Results 201 to 210 of about 5,964 (223)
Some of the next articles are maybe not open access.
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
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
Breaking Verifiable Delay Functions in the Random Oracle Model
Lecture Notes in Computer ScienceZiyi Guan +2 more
exaly +3 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
Tightly secure (H)IBE in the random oracle model
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qiaohan Chu, Jie Chen 0021
openaire +1 more source
Lower Bound on SNARGs in the Random Oracle Model
2022Iftach Haitner +2 more
openaire +2 more sources
Instantiability of Classical Random-Oracle-Model Encryption Transforms
Lecture Notes in Computer Science, 2023Adam O'Neill
exaly