Results 211 to 220 of about 6,728 (248)

Super greedy trees. [PDF]

open access: yesArtif Intell Rev
Ishwaran H.
europepmc   +1 more source

Correcting Subverted Random Oracles

2018
The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes, and can often act as an effective bridge between theory and practice. In this paper, we focus on the basic problem of correcting faulty—or adversarially corrupted—random oracles, so that they can be confidently applied for such ...
Alexander Russell   +3 more
openaire   +1 more source

Deterministic Random Oracles

2012
The Random Oracle model popularized by Bellare and Rogaway in 1993 has proven to be hugely successful, allowing cryptographers to give security proofs for very efficient and practical schemes. In this paper, we discuss the possibility of using an incompressible but fixed, "algorithmically random" oracle instead of the standard random oracle and show ...
openaire   +1 more source

Signcryption with Quantum Random Oracles

2018
Signcryption is a cryptographic scheme that achieves the functionalities of both public-key encryption and digital signatures. It is an important scheme for realizing a mechanism of sending and/or receiving messages in a secure way, since it is understood that signcryption is a public-key based protocol to realize a secure channel from an insecure ...
Shingo Sato, Junji Shikata
openaire   +1 more source

Home - About - Disclaimer - Privacy