Results 271 to 280 of about 4,491,165 (327)

Subquadratic SNARGs in the Random Oracle Model

IACR Cryptology ePrint Archive, 2021
A. Chiesa, E. Yogev
semanticscholar   +1 more source

Random Oracles for Regression Ensembles

2011
This paper considers the use of Random Oracles in Ensembles for regression tasks. A Random Oracle model (Kuncheva and Rodriguez, 2007) consists of a pair of models and a fixed randomly created “oracle” (in the case of the Linear Random Oracle, it is a hyperplane that divides the dataset in two during training and, once the ensemble is trained, decides ...
Carlos Pardo, Juan J. Rodríguez, José F. Díez-Pastor, César García-Osorio   +3 more
openaire   +1 more source

Ring signatures without random oracles

Proceedings of the 2006 ACM Symposium on Information, computer and communications security, 2006
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the random oracle model for security proof. In this paper, we propose a ring signature scheme based on bilinear pairings, which is proven to be secure against adaptive chosen ...
Sherman S. M. Chow, Victor K. Wei, Joseph K. Liu, Tsz Hon Yuen   +3 more
openaire   +1 more source

Digital Signatures Without Random Oracles

2018
In this chapter, we mainly introduce signature schemes under the q-SDH hardness assumption and the CDH assumption. We start by introducing the Boneh-Boyen short signature scheme [21] and then its variant, namely the Gentry scheme, which is modified from his IBE scheme [47]. Most stateless signature schemes without random oracles must produce signatures
Fuchun Guo, Willy Susilo, Yi Mu
openaire   +1 more source

Digital Signatures with Random Oracles

2018
In this chapter, we mainly introduce the BLS scheme [26], the BB RO scheme [20], and the ZSS scheme [104] under the H-Type, the C-Type, and the I-Type structures, respectively.
Fuchun Guo, Willy Susilo, Yi Mu
openaire   +1 more source

$$ITRM$$-Recognizability from Random Oracles

2015
By a theorem of Sacks, if a real \(x\) is recursive relative to all elements of a set of positive Lebesgue measure, \(x\) is recursive. This statement - and the analogous statement for non-meagerness instead of positive Lebesgue measure - has been shown to carry over to many models of transfinite computations in [7].
openaire   +1 more source

Efficient Signcryption Without Random Oracles

2006
Signcryption is an asymmetric cryptographic method that simultaneously provides confidentiality and authenticity at a lower computational and communication overhead. A number of signcryption schemes have been proposed in the literature, but they are only proven to be secure in the random oracle model.
Qianhong Wu, Yi Mu, Willy Susilo, Fangguo Zhang   +3 more
openaire   +1 more source

Generic Authenticated Key Exchange in the Quantum Random Oracle Model

IACR Cryptology ePrint Archive, 2020
Kathrin Hövelmanns, Eike Kiltz, Sven Schäge, Dominique Unruh   +3 more
semanticscholar   +1 more source

Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security

International Conference on the Theory and Application of Cryptographic Techniques, 2020
Veronika Kuchta, A. Sakzad, D. Stehlé, Ron Steinfeld, Shifeng Sun   +4 more
semanticscholar   +1 more source

Random Oracles and Non-uniformity

2018
We revisit security proofs for various cryptographic primitives in the auxiliary-input random-oracle model (AI-ROM), in which an attacker \(\mathcal A\) can compute arbitrary S bits of leakage about the random oracle \(\mathcal O\) before attacking the system and then use additional T oracle queries to \(\mathcal O\) during the attack.
Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John Steinberger   +3 more
openaire   +1 more source