Practical Affiliation-Hiding Authentication from Improved Polynomial Interpolation

Manulis, M and Poettering, B (2011) Practical Affiliation-Hiding Authentication from Improved Polynomial Interpolation In: 6th ACM Symposium on Information, Computer and Communications Security, 2011-03-22 - 2011-03-24, Hong Kong.

Preview	Text MaPo_ASIACCS11.pdf Available under License : See the attached licence file. Download (328kB)
Preview	Text (licence) SRI_deposit_agreement.pdf Download (33kB)

Abstract

Among the plethora of privacy-friendly authentication techniques, affiliation-hiding (AH) protocols are valuable for their ability to hide not only identities of communicating users behind their affiliations (memberships to groups), but also these affiliations from non-members. These qualities become increasingly important in our highly computerized user-centric information society, where privacy is an elusive good. Only little work on practical aspects of AH schemes, pursuing optimized implementations and deployment, has been done so far, and the main question a practitioner might ask --- whether affiliation-hiding schemes are truly practical today --- remained widely unanswered. Improving upon recent advances in the area of AH protocols, in particular on pioneering results in the multi-affiliation setting, we can give an affirmative answer to this question. To this end, we propose numerous algorithmic optimizations to a recent AH scheme leading to a remarkable performance gain. Our results are demonstrated not only at theoretical level, but we also offer implementations, performance measurements, and comparisons. At the same time, our improvements advance the area of efficient polynomial interpolation in finite fields, which is one of our building blocks.

Item Type:	Conference or Workshop Item (Conference Paper)
Divisions :	Faculty of Engineering and Physical Sciences > Computing Science
Authors :	Name Email ORCID Manulis, M Poettering, B
Date :	2011
Identification Number :	10.1145/1966913.1966950
Contributors :	Contribution Name Email ORCID http://www.loc.gov/loc.terms/relators/PBL ACM,
Additional Information :	© ACM, 2011. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ASIACCS 2011, 22-24 Mar 2011. http://doi.acm.org/10.1145/1966913.1966950
Depositing User :	Symplectic Elements
Date Deposited :	31 May 2013 16:26
Last Modified :	31 Oct 2017 14:59
URI:	http://epubs.surrey.ac.uk/id/eprint/755162

Actions (login required)

View Item

Downloads