Sciweavers

1059 search results - page 115 / 212
» Modeling Security Protocols as Games
Sort
View
103
Voted
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
SIAMCOMP
2008
154views more  SIAMCOMP 2008»
14 years 11 months ago
Cryptography in the Bounded-Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
96
Voted
FOCS
2005
IEEE
15 years 6 months ago
Cryptography In the Bounded Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
102
Voted
EUROCRYPT
2004
Springer
15 years 4 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
95
Voted
IAJIT
2010
87views more  IAJIT 2010»
14 years 11 months ago
A performance comparison of MD5 authenticated routing traffic with EIGRP, RIPv2, and OSPF
: Routing is the process of forwarding data across an inter-network from a designated source to a final destination. Along the way from source to destination, at least one intermed...
Khalid Abu Al-Saud, Hatim Mohd Tahir, Moutaz Saleh...