Results 221 to 230 of about 105,934 (253)
Some of the next articles are maybe not open access.
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
Random Oracles for Regression Ensembles
2011This 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 +3 more
openaire +1 more source
Ring signatures without random oracles
Proceedings of the 2006 ACM Symposium on Information, computer and communications security, 2006Since 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 +3 more
openaire +1 more source
Digital Signatures Without Random Oracles
2018In 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
2018In 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
2015By 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