Results 261 to 270 of about 4,491,165 (327)
Some of the next articles are maybe not open access.
Average dependence and random oracles
[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 2003A reconstruction of the foundations of complexity theory relative to random oracles is begun. The goals are to identify the simple, core mathematical principles behind randomness; to use these principles to push hard on the current boundaries of randomness; and to eventually apply these principles in unrelativized complexity.
S.A. Kurtz, S.R. Mahaney, J.S. Royer
openaire +1 more source
Crypto miracles with random oracle
IEEE-Siberian Workshop of Students and Young Researches. Modern Communication Technologies SIBCOM-2001. Proceedings (Cat. No.01EX452), 2002Cryptographic theory has provided the notion of provable security which is often an unattainable ideal in practice. Theoretical work gains provable secure protocols only at the cost of efficiency. Theorists are moving from certain primitives towards powerful sets of primitives.
R.A. Hady, A.V. Agranovsky
openaire +1 more source
Probabilistic Hash-and-Sign with Retry in the Quantum Random Oracle Model
IACR Cryptology ePrint Archive, 2022Haruhisa Kosuge, Keita Xagawa
semanticscholar +1 more source
Proxy Signature Without Random Oracles
2006In mobile Ad Hoc networks, the existence and availability of trusted authorities is severely limited by intrinsic network features, and problems such as “service availability” have become a crucial issue. A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on
Xinyi Huang, Willy Susilo, Yi Mu, Wei Wu
openaire +1 more source
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
Journal of the London Mathematical Society, 2007
AbstractLet R be a notion of algorithmic randomness for individual subsets of ℕ. A set B is a base for R randomness if there is a Z ≥ T B such that Z is R random relative to B. We show that the bases for 1-randomness are exactly the K-trivial sets, and discuss several consequences of this result.
Hirschfeldt, D.R., Nies, A., Stephan, F.
openaire +1 more source
AbstractLet R be a notion of algorithmic randomness for individual subsets of ℕ. A set B is a base for R randomness if there is a Z ≥ T B such that Z is R random relative to B. We show that the bases for 1-randomness are exactly the K-trivial sets, and discuss several consequences of this result.
Hirschfeldt, D.R., Nies, A., Stephan, F.
openaire +1 more source
Signcryption with Quantum Random Oracles
2018Signcryption 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
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model
IACR Cryptology ePrint Archive, 2021Akinori Hosoyamada, Tetsu Iwata
semanticscholar +1 more source