Verifying Privacy by Little Interaction and No Process Equivalence

Denis Butin; Giampaolo Bella

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Verifying Privacy by Little Interaction and No Process Equivalence

Topics: Formal Methods for Security; Privacy; Security Protocols

In Proceedings of the International Conference on Security and Cryptography - Volume 0ICETE, 251-256, 2012 , Rome, Italy

Authors: Denis Butin ¹ and Giampaolo Bella ²

Affiliations: ¹ Dublin City University, Ireland ; ² Università di Catania and De Montfort University, Italy

Keyword(s): e-Voting, Privacy, Inductive Method.

Related Ontology Subjects/Areas/Topics: Data and Application Security and Privacy ; Formal Methods for Security ; Information and Systems Security ; Privacy ; Security Protocols

Abstract: While machine-assisted verification of classical security goals such as confidentiality and authentication is well-established, it is less mature for recent ones. Electronic voting protocols claim properties such as voter privacy. The most common modelling involves indistinguishability, and is specified via trace equivalence in cryptographic extensions of process calculi. However, it has shown restrictions. We describe a novel model, based on unlinkability between two pieces of information. Specifying it as an extension to the Inductive Method allows us to establish voter privacy without the need for approximation or session bounding. The two models and their latest specifications are contrasted.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 13.59.234.182

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Butin, D. and Bella, G. (2012). Verifying Privacy by Little Interaction and No Process Equivalence. In Proceedings of the International Conference on Security and Cryptography (ICETE 2012) - SECRYPT; ISBN 978-989-8565-24-2; ISSN 2184-3236, SciTePress, pages 251-256. DOI: 10.5220/0004043502510256

@conference{secrypt12,
author={Denis Butin. and Giampaolo Bella.},
title={Verifying Privacy by Little Interaction and No Process Equivalence},
booktitle={Proceedings of the International Conference on Security and Cryptography (ICETE 2012) - SECRYPT},
year={2012},
pages={251-256},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004043502510256},
isbn={978-989-8565-24-2},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography (ICETE 2012) - SECRYPT
TI - Verifying Privacy by Little Interaction and No Process Equivalence
SN - 978-989-8565-24-2
IS - 2184-3236
AU - Butin, D.
AU - Bella, G.
PY - 2012
SP - 251
EP - 256
DO - 10.5220/0004043502510256
PB - SciTePress