A dexptime-Complete Dolev-Yao Theory with Distributive Encryption-Reference-Cited by-同舟云学术

A dexptime-Complete Dolev-Yao Theory with Distributive Encryption

Published:2010 Issue: Volume: Page:102-113
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2010
language:
Short-container-title:

Author:

Baskar A.,Ramanujam R.,Suresh S. P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15155-2_11.pdf

Reference16 articles.

1. Lecture Notes in Computer Science;V. Bernat,2008

2. Lecture Notes in Computer Science;A. Bouajjani,1997

3. Baskar, A., Ramanujam, R., Suresh, S.P.: Knowledge-based modelling of voting protocols. In: Proc. of TARK XI, pp. 62–71 (2007)

4. Baskar, A., Ramanujam, R., Suresh, S.P.: A dexptime-complete Dolev-Yao theory with distributive encryption. Technical report (May 2010) http://www.cmi.ac.in/~spsuresh/pdffiles/mfcs2010-tr.pdf

5. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http://www.grappa.univ-lille3.fr/tata

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dolev-Yao Theory with Associative Blindpair Operators;Implementation and Application of Automata;2019

2. Satisfiability of general intruder constraints with and without a set constructor;Journal of Symbolic Computation;2017-05

3. Existential Assertions for Voting Protocols;Financial Cryptography and Data Security;2017

4. The Complexity of Disjunction in Intuitionistic Logic;Logical Foundations of Computer Science;2015-12-10

5. Extending Dolev-Yao with Assertions;Information Systems Security;2014