Sciweavers

876 search results - page 4 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
CTRSA
2006
Springer
176views Cryptology» more  CTRSA 2006»
14 years 2 months ago
Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
Dan Boneh, Xavier Boyen, Shai Halevi
TDHMS
2008
13 years 8 months ago
Oracle Channels
In this paper, well-known attacks named oracle attacks are formulated within a realistic network communication model where they reveal to use suitable covert channels, we name orac...
Ilaria Venturini
ASIACRYPT
2007
Springer
14 years 4 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
ICICS
2007
Springer
14 years 4 months ago
(Convertible) Undeniable Signatures Without Random Oracles
We propose a convertible undeniable signature scheme without random oracles. Our construction is based on the Waters signatures proposed in Eurocrypt 2005. The security of our sche...
Tsz Hon Yuen, Man Ho Au, Joseph K. Liu, Willy Susi...
CCS
2006
ACM
14 years 2 months ago
Ring signatures without random oracles
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 ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...