Sciweavers

325 search results - page 26 / 65
» Concurrent Composition of Secure Protocols in the Timing Mod...
Sort
View
85
Voted
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
83
Voted
ICALP
2005
Springer
15 years 3 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
117
Voted
LICS
1998
IEEE
15 years 1 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
WISEC
2009
ACM
15 years 4 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
164
Voted
ICFP
2009
ACM
15 years 10 months ago
Parallel concurrent ML
Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite ...
John H. Reppy, Claudio V. Russo, Yingqi Xiao