The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Process algebra
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of the ACM (JACM)
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
A calculus for cryptographic protocols
Information and Computation
Variations on mobile processes
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
A Calculus of Communicating Systems
A Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Bisimulation congruence of ℵ-calculus
Information and Computation
Formal analysis of modern security protocols
Information Sciences—Informatics and Computer Science: An International Journal
Automated Verification of Selected Equivalences for Security Protocols
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Acta Informatica
Just fast keying in the pi calculus
ACM Transactions on Information and System Security (TISSEC)
Certificateless undeniable signature scheme
Information Sciences: an International Journal
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Information Sciences: an International Journal
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Symbolic bisimulation for the applied pi calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.07 |
The applied pi calculus proposed by Abadi and Fournet is successful in the analysis of security protocols. Its semantics mainly depends on several structural rules. Structural rules are convenient for specification, but inefficient for implementation. In this paper, we establish a new semantics for applied pi calculus based upon pure labeled transition system and propose a new formulation of labeled bisimulation. We prove that the new labeled bisimularity coincides with observational equivalence. A zero-knowledge protocol is given as an example to illustrate the effectiveness of this new semantics.