Accountability: Definition and relationship to verifiability

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2010, Pages 526-535

  Küsters, Ralf ^a   Truderung, Tomasz ^a   Vogt, Andreas ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Security; Verification

Indexed keywords

ANALYSIS OF PROTOCOLS; COMPUTATIONAL MODEL; IDENTITY BASED ENCRYPTION; NON-REPUDIATION; PROOF OF CONCEPT; SECURE MULTI-PARTY COMPUTATION; SECURITY; TRUSTED PARTY; VERIFIABILITY; WEAK FORM;

CRYPTOGRAPHY; NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 78649990816     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1866307.1866366     Document Type: Conference Paper

References (25)

1. M. Abadi and B. Blanchet. Computer-assisted Verification of a Protocol for Certified Email. Sci. Comput. Program., 58(1-2):3-27, 2005.
2. M. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In POPL 2001, p. 104-115, ACM.
3. N. Asokan, V. Shoup, and M. Waidner. Asynchronous Protocols for Optimistic Fair Exchange. In S&P 1998, p. 86-99, IEEE Computer Society.
4. Y. Aumann and Y. Lindell. Security against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In TCC 2007, vol. 4392 of LNCS, p. 137-156. Springer.
5. G. Bella and L. Paulson. Accountability Protocols: Formalized and Verified. ACM Trans. Inf. Syst. Secur., 9(2):138-161, 2006.
6. J.-M. Bohli, J. Müller-Quade, and S. Röhrich. Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator. In VOTE-ID 2007, vol. 4896 of LNCS, p. 111-124. Springer.
7. D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Ryan, E. Shen, and A. Sherman. Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. In EVT 2008, USENIX Association.
8. D. Chaum, P. Ryan, and S. Schneider. A Practical, Voter-verifiable Election Scheme. In ESORICS 2005, vol. 3679 of LNCS, p. 118-139, Springer.
9. B. Chevallier-Mames, P.-A. Fouque, D. Pointcheval, J. Stern, and J. Traoré. On Some Incompatible Properties of Voting Schemes. In WOTE 2006.
10. J.A. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free Optimistic Contract Signing. In CRYPTO 1999, vol. 1666 of LNCS, p. 449-466, Springer.
11. Vipul Goyal, Steve Lu, Amit Sahai, and Brent Waters. Black-box Accountable Authority Identity-based Encryption. In CCS 2008, p. 427-436, ACM.
12. N. Guts, C. Fournet, and F. Nardelli. Reliable Evidence: Auditability by Typing. In ESORICS 2009, p. 168-183, Springer.
13. R. Jagadeesan, A. Jeffrey, C. Pitcher, and J. Riely. Towards a Theory of Accountability and Audit. In ESORICS 2009, p. 152-167, Springer.
14. W. Jiang, C. Clifton, and M. Kantarcioglu. Transforming Semi-honest Protocols to Ensure Accountability. Data Knowl. Eng., 65(1):57-74, 2008.
15. A. Juels, D. Catalano, and M. Jakobsson. Coercion-resistant Electronic Elections. In WPES 2005, p. 61-70, ACM Press.
16. D. Kähler, R. Küsters, and Th. Wilke. A Dolev-Yao-based Definition of Abuse-free Protocols. In ICALP 2006, vol. 4052 of LNCS, p. 95-106, Springer.
17. R. Küsters, T. Truderung, and A. Vogt. Accountabiliy: Definition and Relationship to Verifiability. ePrint, Report 2010/236.
18. T. Moran and M. Naor. Split-ballot Voting: Everlasting Privacy with Distributed Trust. In CCS 2007, p. 246-255. ACM.
19. D. Parkes, M. Rabin, S. Shieber, and C. Thorpe. Practical Secrecy-preserving, Verifiably Correct and Trustworthy Auctions. In ICEC 2006, p. 70-81.
20. T. Pedersen. Non-interactive and Information-theoretic Secure Verifiable Secret Sharing. In CRYPTO 1991, vol. 576 of LNCS, p. 129-140, Springer.
21. K. Sako and J. Kilian. Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. In EUROCRYPT 1999, vol. 921 of LNCS, p. 393-403, Springer.
22. B. Smyth, M. Ryan, S. Kremer, and M. Kourjieh. Election Verifiability in Electronic Voting Protocols. In WISSec 2009.
23. M. Talbi, B. Morin, V. Tong, A. Bouhoula, and M. Mejri. Specification of Electronic Voting Protocol Properties using ADM Logic: Foo Case Study. In ICICS 2008, vol. 5308 of LNCS, p. 403-418, Springer.
24. Li Yunfeng, He Dake, and Lu Xianhui. Accountability of Perfect Concurrent Signature. ICCEE 2008, p. 773-777.
25. J. Zhou and D. Gollmann. A Fair Non-repudiation Protocol. In S&P 1996, p. 55-61, IEEE Computer Society Press.