Sciweavers

659 search results - page 86 / 132
» Compiling and securing cryptographic protocols
Sort
View
CCS
2005
ACM
15 years 8 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
ACSAC
2002
IEEE
15 years 7 months ago
A Security Architecture for Object-Based Distributed Systems
Large-scale distributed systems present numerous security problems not present in local systems. In this paper we present a general security architecture for a large-scale object-...
Bogdan C. Popescu, Maarten van Steen, Andrew S. Ta...
103
Voted
ESORICS
2008
Springer
15 years 4 months ago
State Space Reduction in the Maude-NRL Protocol Analyzer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...
Santiago Escobar, Catherine Meadows, José M...
126
Voted
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 6 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
DSN
2002
IEEE
15 years 7 months ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz