Results 221 to 230 of about 106,354 (248)

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

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

Leaky Random Oracle (Extended Abstract)

2008
This work focuses on vulnerability of hash functions due to sloppy usage or implementation in the real world. If our cryptographic research community succeeded in development of perfectly secure random function as random oracle, it might be broken in some sense by invalid uses. In this paper, we propose a new variant of the random oracle model in order
Kazuki Yoneyama, Satoshi Miyagawa, Kazuo Ohta   +2 more
openaire   +1 more source

Augmented Random Oracles

2022
openaire   +1 more source

Thwarting All Logic Locking Attacks: Dishonest Oracle With Truly Random Logic Locking

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2021
Nimisha Limaye, Emmanouil Kalligeros, Irene Karybali   +2 more
exaly  

Secure and Efficient Certificateless Searchable Authenticated Encryption Scheme Without Random Oracle for Industrial Internet of Things

IEEE Systems Journal, 2023
Zhenyu Hu, Lunzhi Deng
exaly