Sciweavers

199 search results - page 31 / 40
» A survey of algebraic properties used in cryptographic proto...
Sort
View
IANDC
2007
152views more  IANDC 2007»
13 years 10 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 4 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
ESOP
2008
Springer
14 years 16 days ago
A Formal Implementation of Value Commitment
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
Cédric Fournet, Nataliya Guts, Francesco Za...
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 5 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
SPW
2004
Springer
14 years 4 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson