Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker-Reference-Cited by-同舟云学术

Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker

Published:2018 Issue: Volume: Page:350-372
ISSN:0302-9743
Container-title:Computer Security
language:
Short-container-title:

Author:

Bana Gergei,Chadha Rohit,Eeralla Ajay Kumar

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-98989-1_18

Reference28 articles.

1. Lecture Notes in Computer Science;A Fujioka,1993

2. Adida, B.: Helios: web-based open-audit voting. In: Proceedings of the 17th Conference on Security Symposium. SS 2008, pp. 335–348. USENIX Association (2008)

3. Lecture Notes in Computer Science;PYA Ryan,2016

4. Lecture Notes in Computer Science;S Kremer,2005

5. Abadi, M., Blanchet, B., Fournet, C.: The applied pi calculus: mobile values, new names, and secure communication. J. ACM 65, 1–41 (2017)

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

1. A Higher-Order Indistinguishability Logic for Cryptographic Reasoning;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. A Framework for Formal Analysis of Anonymous Communication Protocols;Security and Communication Networks;2022-05-02

3. A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols;P IEEE S SECUR PRIV;2022

4. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability;ACM Transactions on Computational Logic;2021-01-31

5. Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets;Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security;2020-10-30