A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
ACM Transactions on Computer Systems (TOCS)
Journal of the ACM (JACM)
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A Formal Language for Cryptographic Protocol Requirements
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
Communication and Concurrency
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
Formal Eavesdropping and Its Computational Interpretation
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The AVISS Security Protocol Analysis Tool
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Casper: A Compiler for the Analysis of Security Protocols
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Mechanized proofs for a recursive authentication protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Tool for Lazy Verification of Security Protocols
Proceedings of the 16th IEEE international conference on Automated software engineering
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
CONCUR 2005 - Concurrency Theory
A Computationally Sound Mechanized Prover for Security Protocols
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Cryptographically Sound Theorem Proving
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
A computational interpretation of Dolev-Yao adversaries
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Theoretical Computer Science - Automated reasoning for security protocol analysis
Compositional Security for Task-PIOAs
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Definitions and Analysis of Integrity in Strand Spaces Model
ISECS '08 Proceedings of the 2008 International Symposium on Electronic Commerce and Security
A flaw in the electronic commerce protocol SET
Information Processing Letters
A generalization of DDH with applications to protocol analysis and computational soundness
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
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
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Computationally sound implementations of equational theories against passive adversaries
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Proceedings of the 14th European conference on Programming Languages and Systems
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Computationally sound, automated proofs for security protocols
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Completing the picture: soundness of formal encryption in the presence of active adversaries
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A type system for computationally secure information flow
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Soundness of formal encryption in the presence of key-cycles
ESORICS'05 Proceedings of the 10th 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
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
It is customary to view the scheduler as an intruder when modelling security protocols by means of process calculi that express both nondeterministic and probabilistic behavior. It has been established that traditional schedulers need to be carefully calibrated in order to more accurately reflect an intruder's real power. We propose such a class of schedulers through a variant of the Probabilistic Poly-time Calculus (PPC) of Mitchell et al. (Theoretical Computer Science 353 (2006), 118-164) called PPC νσ. We define two levels of schedulers: adversarial schedulers which schedule a class of indistinguishable actions i.e. actions that we do not want an attacker to distinguish, and internal schedulers, called task schedulers, which resolve the remaining nondeterminism within a chosen class. We also show how to apply them in order to design schedulers for the analysis of cryptographic protocols that accurately reflect an intruder's capacity for controlling communication networks, without allowing it to control the internal reactions of the protocol under attack. We give a new characterization of the asymptotic observational equivalence of Mitchell et al. (Theoretical Computer Science 353 (2006), 118-164) that is more suited for taking into account any observable trace rather than just one single action. This asymptotic observational equivalence is a congruence in accordance with these new schedulers. We illustrate the aptness of our approach by an extensive study of the Dining Cryptographers (DCP) (J. Cryptology 1 (1988), 65-75) protocol. Research partially supported by an individual NSERC research grant (Canada) of the author.