Sciweavers

3751 search results - page 479 / 751
» Events in security protocols
Sort
View
CCS
2001
ACM
15 years 10 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 10 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ICISC
2009
169views Cryptology» more  ICISC 2009»
15 years 4 months ago
Generic One Round Group Key Exchange in the Standard Model
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...
CCS
2011
ACM
14 years 6 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg
APNOMS
2009
Springer
16 years 1 months ago
IP Prefix Hijacking Detection Using Idle Scan
The Internet is comprised of a lot of interconnected networks communicating reachability information using BGP. Due to the design based on trust between networks, IP prefix hijacki...
Seong-Cheol Hong, Hong-Taek Ju, James W. Hong