Sciweavers

876 search results - page 28 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
90
Voted
IJNSEC
2008
112views more  IJNSEC 2008»
15 years 19 days ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo
99
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
89
Voted
TCC
2007
Springer
93views Cryptology» more  TCC 2007»
15 years 6 months ago
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Abstract. We construct an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model. The model employs a long shared private key to...
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke L...
96
Voted
ACNS
2004
Springer
156views Cryptology» more  ACNS 2004»
15 years 6 months ago
One-Round Protocols for Two-Party Authenticated Key Exchange
Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channe...
Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee
92
Voted
FC
2003
Springer
101views Cryptology» more  FC 2003»
15 years 5 months ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt