Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Computer-assisted verification of a protocol for certified email
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Accountability protocols: Formalized and verified
ACM Transactions on Information and System Security (TISSEC)
Practical secrecy-preserving, verifiably correct and trustworthy auctions
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
Split-ballot voting: everlasting privacy with distributed trust
Proceedings of the 14th ACM conference on Computer and communications security
Transforming semi-honest protocols to ensure accountability
Data & Knowledge Engineering
Black-box accountable authority identity-based encryption
Proceedings of the 15th ACM conference on Computer and communications security
Specification of Electronic Voting Protocol Properties Using ADM Logic: FOO Case Study
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Accountability of Perfect Concurrent Signature
ICCEE '08 Proceedings of the 2008 International Conference on Computer and Electrical Engineering
EVT'08 Proceedings of the conference on Electronic voting technology
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Security against covert adversaries: efficient protocols for realistic adversaries
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Bingo voting: secure and coercion-free voting using a trusted random number generator
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Towards a theory of accountability and audit
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Reliable evidence: auditability by typing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A dolev-yao-based definition of abuse-free protocols
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Proving coercion-resistance of scantegrity II
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Towards a formal model of accountability
Proceedings of the 2011 workshop on New security paradigms workshop
Understanding and protecting privacy: formal semantics and principled audit mechanisms
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
Towards a theory of trust in networks of humans and computers (transcript of discussion)
SP'11 Proceedings of the 19th international conference on Security Protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Formal verification of e-auction protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Defining verifiability in e-auction protocols
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Remotegrity: design and use of an end-to-end verifiable remote voting system
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Dispute resolution in accessible voting systems: the design and use of audiotegrity
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Accountability and deterrence in online life
Proceedings of the 3rd International Web Science Conference
A game-based definition of coercion resistance and its applications
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation, involve the use of (semi-)trusted parties, such as notaries and authorities. It is crucial that such parties can be held accountable in case they misbehave as this is a strong incentive for such parties to follow the protocol. Unfortunately, there does not exist a general and convincing definition of accountability that would allow to assess the level of accountability a protocol provides. In this paper, we therefore propose a new, widely applicable definition of accountability, with interpretations both in symbolic and computational models. Our definition reveals that accountability is closely related to verifiability, for which we also propose a new definition. We prove that verifiability can be interpreted as a weak form of accountability. Our findings on verifiability are of independent interest. As a proof of concept, we apply our definitions to the analysis of protocols for three different tasks: contract-signing, voting, and auctions. Our analysis unveils some subtleties and unexpected weaknesses, showing in one case that the protocol is unusable in practice. However, for this protocol we propose a fix to establish a reasonable level of accountability.