Sciweavers

3115 search results - page 283 / 623
» Synthesizing Secure Protocols
Sort
View
CCS
2005
ACM
16 years 7 days ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
179
Voted
NDSS
2002
IEEE
15 years 11 months ago
Advanced Client/Server Authentication in TLS
Many business transactions on the Internet occur between strangers, that is, between entities with no prior relationship and no common security domain. Traditional security approa...
Adam Hess, Jared Jacobson, Hyrum Mills, Ryan Wamsl...
CCS
2006
ACM
15 years 10 months ago
Deniable authentication and key exchange
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...
Mario Di Raimondo, Rosario Gennaro, Hugo Krawczyk
EUROCRYPT
2004
Springer
15 years 10 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
160
Voted
IAJIT
2010
87views more  IAJIT 2010»
15 years 5 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...