Sciweavers

361 search results - page 54 / 73
» Composition of Password-Based Protocols
Sort
View
TOOLS
2008
IEEE
14 years 1 months ago
Modeling of Component Environment in Presence of Callbacks and Autonomous Activities
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
Pavel Parizek, Frantisek Plasil
SENSYS
2005
ACM
14 years 1 months ago
A unifying link abstraction for wireless sensor networks
ng Link Abstraction for Wireless Sensor Networks Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, and Ion Stoica Computer Science Department In...
Joseph Polastre, Jonathan Hui, Philip Levis, Jerry...
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
CTRSA
2008
Springer
137views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Beyond Secret Handshakes: Affiliation-Hiding Authenticated Key Exchange
Public key based authentication and key exchange protocols are not usually designed with privacy in mind and thus involve cleartext exchanges of identities and certificates before ...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...