Sciweavers

1612 search results - page 170 / 323
» About models of security protocols
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 8 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...
164
Voted
CCS
2011
ACM
14 years 5 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
CAINE
2008
15 years 6 months ago
New Architecture and Protocols for Global-Scale Machine Communities
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...
Vladimir Krylov, N. Mikhaylov, Dmitry V. Ponomarev
135
Voted
SRDS
2003
IEEE
15 years 10 months ago
Group Communication Protocols under Errors
Group communication protocols constitute a basic building block for highly dependable distributed applications. Designing and correctly implementing a group communication system (...
Claudio Basile, Long Wang, Zbigniew Kalbarczyk, Ra...
AINA
2003
IEEE
15 years 9 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu