Abstract
We introduce and motivate the concept of unclonable group identification, that provides maximal protection against sharing of identities while still protecting the anonymity of users. We prove that the notion can be realized from any one-way function and suggest a more efficient implementation based on specific assumptions. © International Association for Cryptologic Research 2006.
Cite
CITATION STYLE
Damgård, I., Dupont, K., & Pedersen, M. Ø. (2006). Unclonable group identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4004 LNCS, pp. 555–572). Springer Verlag. https://doi.org/10.1007/11761679_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
