Pang, Jun ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Zhang, C.
External co-authors :
yes
Language :
English
Title :
How to work with honest but curious judges? (preliminary report)
Publication date :
2009
Event name :
Proc. 7th International Workshop on Security Issues in Concurrency
Event date :
2009
Audience :
International
Main work title :
Proc. 7th International Workshop on Security Issues in Concurrency
Collection name :
Electronic Proceedings in Theoretical Computer Science 7
J. Aspnes and E. Ruppert. An Introduction to Population Protocols. Bulletin of the European Association for Theoretical Computer Science, 93:98-117, 2007.
A. Beimel, K. Nissim, and E. Omri. Distributed private data analysis: Simultaneously solving how and what. In Proc. 28th Annual International Cryptology Conference, volume 5157 of Lecture Notes in Computer Science, pages 451-468. Springer, 2008.
M. Bhargava and C. Palamidessi. Probabilistic anonymity. In Proc. 16th Conference on Concurrency Theory, volume 3653 of Lecture Notes in Computer Science, pages 171-185. Springer, 2005.
B. Blanchet. An efficient cryptographic protocol verifier based on Prolog rules. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 82-96. IEEE Computer Society, 2001.
S. C. C. Blom, J. R. Calame, B. Lisser, S. M. Orzan, J. Pang, J. C. van de Pol, M. Torabi Dashti, and A. J. Wijs. Distributed analysis with πCRL: A compendium of case studies. In Proc. 13th Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 4424 of Lecture Notes in Computer Science, pages 683-689. Springer, 2007.
F. Brandt. Efficient cryptographic protocol design based on distributed El Gamal encryption. In Proc. 8th Conference on Information Security and Cryptology, volume 3935 of Lecture Notes in Computer Science, pages 32-47. Springer, 2006.
K. Chatzikokolakis, C. Palamidessi, and P. Panangaden. Anonymity protocols as noisy channels. In Proc. 2nd Symposium on Trustworthy Global Computing, volume 4661 of Lecture Notes in Computer Science, pages 281-300. Springer, 2007.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75, 1988.
B. Chor and E. Kushilevitz. A communication-privacy tradeoff for modular addition. Information Processing Letters, 45(4):205-210, 1993.
T. Chothia, S. M. Orzan, J. Pang, and M. Torabi Dashti. A framework for automatically checking anonymity with πCRL. In Proc. 2nd Symposium on Trustworthy Global Computing, volume 4661 of Lecture Notes in Computer Science, pages 301-318. Springer, 2007.
C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert. Secretive birds: Privacy in population protocols. In Proc. 11th Conference on Principles of Distributed Systems, volume 4878 of Lecture Notes in Computer Science, pages 329-342. Springer, 2007.
Y. Deng, C. Palamidessi, and J. Pang. Weak probabilistic anonymity. In Proc. 3rd Workshop on Security Issues in Concurrency, Electronic Notes in Theoretical Computer Science 180, pages 55-76, 2007.
E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science (B), pages 955- 1072. MIT Press, 1990.
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. MIT Press, 1995.
P. Golle and A. Juels. Dining cryptographers revisited. In Proc. 23rd Conference on the Theory and Applications of Cryptographic Techniques, volume 3027 of Lecture Notes in Computer Science, pages 456-473. Springer, 2004.
J. Y. Halpern and K. R. O'Neill. Anonymity and information hiding in multiagent systems. In Proc. 16th IEEE Computer Security Foundations Workshop, pages 75-88. IEEE Computer Society, 2003.
F. Hao and P. Zieliński. The power of anonymous veto in public discussion. Transactions on Computational Science, 4:41-52, 2009.
D. Hughes and V. Shmatikov. Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security, 12(1):3-36, 2004.
S. Kremer andM. D. Ryan. Analysis of an electronic voting protocol in the applied pi calculus. In Proc. 14th European Symposium on Programming, volume 3444 of Lecture Notes in Computer Science, pages 186-200. Springer, 2005.
A. Lomuscio, H. Qu, and F. Raimondi.MCMAS: Amodel checker for the verification ofmulti-agent systems. In Proc. 21th Conference on Computer Aided Verification, Lecture Notes in Computer Science. Springer, 2009.
G. Lowe. Breaking and fixing the needham-schroeder public-key protocol using FDR. In Proc. 2nd Workshop on Tools and Algorithms for Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 147-166. Springer, 1996.
A. M. McIver and C. C. Morgan. Personal communications, 2009.
S. Radomirović. Personal communications, 2009.
R. L. Rivest. Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer, 1999. Unpublished manuscript.
S. Schneider and A. Sidiropoulos. CSP and anonymity. In Proc. 4th European Symposium on Research in Computer Security, volume 1146 of Lecture Notes in Computer Science, pages 198-218. Springer, 1996.
J. Sun, Y. Liu, J.-S. Dong, and J. Pang. PAT: Towards flexible verification under fairness. In Proc. 21th Conference on Computer Aided Verification, volume 5643 of Lecture Notes in Computer Science, pages 709-714. Springer, 2009.
R. van der Meyden and K. Su. Symbolic model checking the knowledge of the dining cryptographers. In Proc. 17th IEEE Computer Security Foundations Workshop, pages 280-291. IEEE Computer Society, 2004.
J. van Eijck and S.M. Orzan. Epistemic verification of anonymity. In Proc. 1stWorkshop Views On Designing Complex Architectures, Electronic Notes in Theoretical Computer Science 168, pages 159-174, 2007.
M.Waidner and B. Pfitzmann. The dining cryptographers in the disco - underconditional sender and recipient untraceability with computationally secure serviceability (abstract). In Proc. Workshop on the Theory and Application of of Cryptographic Techniques, volume 434 of Lecture Notes in Computer Science, page 690. Springer, 1990.
A. C-C. Yao. Protocols for secure computations (extended abstract). In Proc. 23rd Annual Symposium on Foundations of Computer Science, pages 160-164. IEEE Computer Society, 1982.
