Article

Specifying electronic voting protocols in typed MSR

Authors:

Theodoros Balopoulos,

Stefanos Gritzalis,

Sokratis K. KatsikasAuthors Info & Claims

WPES '05: Proceedings of the 2005 ACM workshop on Privacy in the electronic society

Pages 35 - 39

https://doi.org/10.1145/1102199.1102207

Published: 07 November 2005 Publication History

Get Access

Abstract

Electronic voting, as well as other privacy-preserving protocols, use special cryptographic primitives and techniques that are not widely used in other types of protocols, e.g. in authentication protocols. These include blind signatures, commitments, zero-knowledge proofs, mixes and homomorphic encryption. Furthermore, typical formalizations of the Dolev-Yao intruder's capabilities do not take into account these primitives and techniques, nor do they consider some types of attacks that e-voting as well as other types of protocols are designed to protect against, such as privacy attacks due to undesired linkability of protocol executions. This work aims to extend Typed MSR so that it is able to support the specification of privacy-preserving protocols, as well as the capabilities of a Dolev-Yao intruder designed to attack such protocols.

References

[1]

Alessandro Acquisti. Receipt-free homomorphic elections and write-in ballots. Technical Report 2004/105, International Association for Cryptologic Research, May 2004.]]

Google Scholar

[2]

D. Aspinall and A. Compagnoni. Subtyping dependent types. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 86--97. IEEE Computer Society Press, July 1996.]]

Digital Library

Google Scholar

[3]

Theodoros Balopoulos, Stefanos Gritzalis, and Sokratis K. Katsikas. Specifying privacy-preserving protocols in Typed MSR. Computer Standards & Interfaces, 27(5):501--512, June 2005.]]

Digital Library

Google Scholar

[4]

Fabrice Boudot. Efficient proofs that a committed number lies in an interval. In EUROCRYPT, pages 431--444, 2000.]]

Digital Library

Google Scholar

[5]

Iliano Cervesato. Typed Multiset Rewriting Specifications of Security Protocols. In A. Seda, editor, First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology --- MFCSIT'00, pages 1--43, Cork, Ireland, 19--21 July 2000. Elsevier ENTCS 40.]]

Google Scholar

[6]

Iliano Cervesato. Typed MSR: Syntax and Examples. In V.I. Gorodetski, V.A. Skormin, and L.J. Popyack, editors, em First International Workshop on Mathematical Methods, Models and Architectures for Computer Networks Security --- MMM'01, pages 159--177, St. Petersburg, Russia, 21--23 May 2001. Springer-Verlag LNCS 2052.]]

Digital Library

Google Scholar

[7]

David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 4(2), February 1981.]]

Digital Library

Google Scholar

[8]

David Chaum. Security without identification: transaction systems to make big brother obsolete. Communications of the Association for Computing Machinery, 28(10):1030--1044, October 1985.]]

Digital Library

Google Scholar

[9]

D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 2(29):198--208, 1983.]]

Digital Library

Google Scholar

[10]

Jason E. Holt and Kent E. Seamons. Selective disclosure credential sets. Accessible as http://citeseer.nj.nec.com/541329.html, 2002.]]

Google Scholar

[11]

P. Paillier. Public-key cryptosystems based on discrete logarithms residues. In Advances in Cryptology - Eurocrypt '99, pages 223--238. Springer-Verlag LNCS 1592, 1999.]]

Crossref

Google Scholar

[12]

Paul Syverson, Catherine Meadows, and Iliano Cervesato. Dolev- Y ao is no better than M achiavelli. In P. Degano, editor, First Workshop on Issues in the Theory of Security --- WITS'00, pages 87--92, July 2000.]]

Google Scholar

Cited By

View all

Liu XTang S(2008)Formal Privacy Analysis of an Electronic Voting SchemeProceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 0210.1109/CIS.2008.114(283-287)Online publication date: 13-Dec-2008
https://dl.acm.org/doi/10.1109/CIS.2008.114
Balopoulos TGritzalis SKatsikas S(2008)Specifying and implementing privacy-preserving cryptographic protocolsInternational Journal of Information Security10.1007/s10207-008-0057-y7:6(395-420)Online publication date: 18-Oct-2008
https://dl.acm.org/doi/10.1007/s10207-008-0057-y

Index Terms

Specifying electronic voting protocols in typed MSR
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Formal software verification
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program specifications

Recommendations

Specifying Privacy-Preserving Protocols in Typed MSR

Privacy-preserving protocols, such as electronic cash, electronic voting and selective disclosure protocols, use special message constructors that are not widely used in other types of protocols (for example, in authentication protocols). These message ...
Specifying and implementing privacy-preserving cryptographic protocols

Formal methods are an important tool for designing secure cryptographic protocols. However, the existing work on formal methods does not cover privacy-preserving protocols as much as other types of protocols. Furthermore, privacy-related properties, ...
An intruder model for verifying liveness in security protocols
FMSE '06: Proceedings of the fourth ACM workshop on Formal methods in security

We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equivalent to a Dolev-Yao intruder that does not delay indefinitely the ...

Comments

Information & Contributors

Information

Published In

WPES '05: Proceedings of the 2005 ACM workshop on Privacy in the electronic society

November 2005

116 pages

ISBN:1595932283

DOI:10.1145/1102199

General Chair:
Vijay Atluri
Rutgers University
,
Program Chairs:
Sabrina De Capitani di Vimercati
Università degli Studi di Milano, Italy
,
Roger Dingledine
The Free Haven Project

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS05

Sponsor:

CCS05: 12th ACM Conference on Computer and Communications Security 2005

November 7, 2005

VA, Alexandria, USA

Acceptance Rates

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
377
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu XTang S(2008)Formal Privacy Analysis of an Electronic Voting SchemeProceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 0210.1109/CIS.2008.114(283-287)Online publication date: 13-Dec-2008
https://dl.acm.org/doi/10.1109/CIS.2008.114
Balopoulos TGritzalis SKatsikas S(2008)Specifying and implementing privacy-preserving cryptographic protocolsInternational Journal of Information Security10.1007/s10207-008-0057-y7:6(395-420)Online publication date: 18-Oct-2008
https://dl.acm.org/doi/10.1007/s10207-008-0057-y

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Specifying Privacy-Preserving Protocols in Typed MSR

Specifying and implementing privacy-preserving cryptographic protocols

An intruder model for verifying liveness in security protocols

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations