Formal Eavesdropping and Its Computational Interpretation
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Cryptographically Sound and Machine-Assisted Verification of Security Protocols
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Computational Probabilistic Non-interference
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Securing Communication in a Concurrent Language
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Polynomial Fairness and Liveness
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Probabilistic Analysis of Anonymity
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Intransitive Non-Interference for Cryptographic Purposes
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Proactive secure message transmission in asynchronous networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Proceedings of the 2003 workshop on New security paradigms
New notions of security: achieving universal composability without trusted setup
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Towards provable security for ad hoc routing protocols
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Proceedings of the 11th ACM conference on Computer and communications security
Relating cryptography and formal methods: a panel
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
The faithfulness of abstract protocol analysis: message authentication
Journal of Computer Security - Special issue on ACM conference on computer and communications security, 2001
Relating Symbolic and Cryptographic Secrecy
IEEE Transactions on Dependable and Secure Computing
Secrecy types for a simulatable cryptographic library
Proceedings of the 12th ACM conference on Computer and communications security
Modeling insider attacks on group key-exchange protocols
Proceedings of the 12th ACM conference on Computer and communications security
Proving a WS-federation passive requestor profile with a browser model
Proceedings of the 2005 workshop on Secure web services
On fairness in simulatability-based cryptographic systems
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Towards computationally sound symbolic analysis of key exchange protocols
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Proving a WS-Federation passive requestor profile
SWS '04 Proceedings of the 2004 workshop on Secure web service
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
A derivation system and compositional logic for security protocols
Journal of Computer Security
A computational analysis of the Needham-Schroeder-(Lowe) protocol
Journal of Computer Security
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
A protocol for property-based attestation
Proceedings of the first ACM workshop on Scalable trusted computing
Modelling adversaries and security objectives for routing protocols in wireless sensor networks
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Computationally sound secrecy proofs by mechanized flow analysis
Proceedings of the 13th ACM conference on Computer and communications security
ACM SIGACT news distributed computing column 24
ACM SIGACT News
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Provably secure authenticated group Diffie-Hellman key exchange
ACM Transactions on Information and System Security (TISSEC)
Journal of Computer Security - Special issue on CSFW15
Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities
Proceedings of the 2007 ACM workshop on Privacy in electronic society
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Preservation of epistemic properties in security protocol implementations
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
Preservation of probabilistic information flow under refinement
Information and Computation
Provably secure browser-based user-aware mutual authentication over TLS
Proceedings of the 2008 ACM symposium on Information, computer and communications security
A New Direct Anonymous Attestation Scheme from Bilinear Maps
Trust '08 Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications
Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same Origin Policy
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Composable Security in the Bounded-Quantum-Storage Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Modeling Computational Security in Long-Lived Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
The layered games framework for specifications and analysis of security protocols
International Journal of Applied Cryptography
A Browser-Based Kerberos Authentication Scheme
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
A Universally Composable Framework for the Analysis of Browser-Based Security Protocols
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
User-aided data authentication
International Journal of Security and Networks
Universally Composable RFID Identification and Authentication Protocols
ACM Transactions on Information and System Security (TISSEC)
Realistic Failures in Secure Multi-party Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Proceedings of the forty-first annual ACM symposium on Theory of computing
User-aware provably secure protocols for browser-based mutual authentication
International Journal of Applied Cryptography
Oblivious transfer with access control
Proceedings of the 16th ACM conference on Computer and communications security
Polynomial runtime in simulatability definitions
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Fully Robust Tree-Diffie-Hellman Group Key Exchange
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
Electronic Notes in Theoretical Computer Science (ENTCS)
On the necessity of rewinding in secure multiparty computation
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Security in business process engineering
BPM'03 Proceedings of the 2003 international conference on Business process management
Handling encryption in an analysis for secure information flow
ESOP'03 Proceedings of the 12th European conference on Programming
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Obtaining universally compoable security: towards the bare bones of trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
On simulatability soundness and mapping soundness of symbolic cryptography
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Simulation-based analysis of E2E voting systems
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Application of dependency graphs to security protocol analysis
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
The layered games framework for specifications and analysis of security protocols
TCC'08 Proceedings of the 5th conference on Theory of cryptography
MPC vs. SFE: perfect security in a unified corruption model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Compositional System Security with Interface-Confined Adversaries
Electronic Notes in Theoretical Computer Science (ENTCS)
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
Proceedings of the 17th ACM conference on Computer and communications security
Conditional automata: a tool for safe removal of negligible events
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Ideal key derivation and encryption in simulation-based security
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Oblivious transfer with hidden access control policies
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Implementing cryptographic primitives in the symbolic model
NFM'11 Proceedings of the Third international conference on NASA Formal methods
A novel framework for protocol analysis
ProvSec'11 Proceedings of the 5th international conference on Provable security
From security protocols to systems security
Proceedings of the 11th international conference on Security Protocols
Stepwise development of secure systems
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
Fairness and correctness in case of a premature abort
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
A simulation-based treatment of authenticated message exchange
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Justifying a dolev-yao model under active attacks
Foundations of Security Analysis and Design III
Comparing two notions of simulatability
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the relationships between notions of simulation-based security
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Entropic security and the encryption of high entropy messages
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Merkle-Damgård revisited: how to construct a hash function
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
A type system for computationally secure information flow
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Machine-checked security proofs of cryptographic signature schemes
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Limits of the cryptographic realization of dolev-yao-style XOR
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Quantifying probabilistic information flow in computational reactive systems
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Soundness of formal encryption in the presence of key-cycles
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Browser model for security analysis of browser-based protocols
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
On the notion of statistical security in simulatability definitions
ISC'05 Proceedings of the 8th international conference on Information Security
Universally composable time-stamping schemes with audit
ISC'05 Proceedings of the 8th international conference on Information Security
Design of secure key establishment protocols: successes, failures and prospects
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Secure protocols for complex tasks in complex environments
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
A formal framework for confidentiality-preserving refinement
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Cryptographically sound security proofs for basic and public-key kerberos
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Limits of the BRSIM/UC soundness of dolev-yao models with hashes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Conditional reactive simulatability
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Unlinkable priced oblivious transfer with rechargeable wallets
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient device-independent quantum key distribution
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Universally composable quantum multi-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Formal methods and cryptography
FM'06 Proceedings of the 14th international conference on Formal Methods
Universally composable simultaneous broadcast
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On the (im-)possibility of extending coin toss
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Towards provable security for ubiquitous applications
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Mix-Network with stronger security
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Confidentiality and integrity: a constructive perspective
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Oblivious transfer with hidden access control from attribute-based encryption
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
An equational approach to secure multi-party computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Computational soundness of coinductive symbolic security under active attacks
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
A proof technique for security assessment of on-demand ad hoc routing protocols
International Journal of Security and Networks
Hi-index | 0.00 |
Abstract: We present a rigorous model for secure reactive systems in asynchronous networks with a sound cryptographic semantics, supporting abstract specifications and the composition of secure systems. This enables modular proofs of security, which is essential in bridging the gap between the rigorous proof techniques of cryptography and tool-supported formal proof techniques. The model follows the general simulatability approach of modern cryptography. A variety of network structures and trust models can be described, such as static and adaptive adversaries; some examples of this are given. As an example of our specification methodology we provide an abstract and complete specification for Secure Message Transmission, improving on recent results by Lynch, and verify one concrete implementation. Our proof is based on a general theorem on the security of encryption in a reactive multi-user setting, generalizing a recent result by Bellare et.al.