Sciweavers

9821 search results - page 141 / 1965
» A Framework for the Development of Protocols
Sort
View
CONCUR
2003
Springer
15 years 9 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
JSAC
2008
110views more  JSAC 2008»
15 years 4 months ago
Designing Multicast Protocols for Non-Cooperative Networks
Conventionally, most network protocols assume that the network entities who participate in the network activities will always behave as instructed. However, in practice, most netwo...
Weizhao Wang, Xiang-Yang Li, Yu Wang 0003, Zheng S...
CSFW
2010
IEEE
15 years 8 months ago
A Framework for the Sound Specification of Cryptographic Tasks
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou
ICNP
2006
IEEE
15 years 10 months ago
Robust Path-Vector Routing Despite Inconsistent Route Preferences
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
Aaron D. Jaggard, Vijay Ramachandran
INFOCOM
2005
IEEE
15 years 10 months ago
Limiting path exploration in BGP
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
Jaideep Chandrashekar, Zhenhai Duan, Zhi-Li Zhang,...