Sciweavers

325 search results - page 7 / 65
» Concurrent Composition of Secure Protocols in the Timing Mod...
Sort
View
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
ICSE
2009
IEEE-ACM
13 years 5 months ago
Slede: Framework for automatic verification of sensor network security protocol implementations
Verifying security properties of protocols requires developers to manually create protocol-specific intruder models, which could be tedious and error prone. We present Slede, a ve...
Youssef Hanna, Hridesh Rajan
FORTE
2008
13 years 9 months ago
Protocol Modeling with Model Program Composition
Designing and interoperability testing of distributed, application-level network protocols is complex. Windows, for example, supports currently more than 200 protocols, ranging fro...
Margus Veanes, Wolfram Schulte
ACISP
2009
Springer
14 years 2 months ago
Towards Denial-of-Service-Resilient Key Agreement Protocols
Denial of service resilience is an important practical consideration for key agreement protocols in any hostile environment such as the Internet. There are well-known models that ...
Douglas Stebila, Berkant Ustaoglu
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
14 years 20 days ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin