Certified pseudonyms colligated with master secret key

Vijayakrishnan Pasupathinathan; Josef Pieprzyk; Huaxiong Wang

Certified pseudonyms colligated with master secret key

Vijayakrishnan Pasupathinathan^*, Josef Pieprzyk, Huaxiong Wang

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

Abstract

A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.

Original language	English
Title of host publication	SECRYPT 2009 - International Conference on Security and Cryptography, Proceedings
Editors	Eduardo Fernández-Medina, Manu Malek, Javier Hernando
Place of Publication	Setúbal, Portugal
Publisher	INSTICC
Pages	190-197
Number of pages	8
ISBN (Print)	9789896740054
Publication status	Published - 2009
Event	SECRYPT 2009 - International Conference on Security and Cryptography - Milan, Italy Duration: 7 Jul 2009 → 7 Oct 2009

Other

Other	SECRYPT 2009 - International Conference on Security and Cryptography
Country/Territory	Italy
City	Milan
Period	7/07/09 → 7/10/09

Cite this

@inproceedings{eba6316fca3f4be1b4df448552acccb1,

title = "Certified pseudonyms colligated with master secret key",

abstract = "A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.",

author = "Vijayakrishnan Pasupathinathan and Josef Pieprzyk and Huaxiong Wang",

year = "2009",

language = "English",

isbn = "9789896740054",

pages = "190--197",

editor = "Eduardo Fern{\'a}ndez-Medina and Manu Malek and Javier Hernando",

booktitle = "SECRYPT 2009 - International Conference on Security and Cryptography, Proceedings",

publisher = "INSTICC",

note = "SECRYPT 2009 - International Conference on Security and Cryptography ; Conference date: 07-07-2009 Through 07-10-2009",

}

Pasupathinathan, V, Pieprzyk, J & Wang, H 2009, Certified pseudonyms colligated with master secret key. in E Fernández-Medina, M Malek & J Hernando (eds), SECRYPT 2009 - International Conference on Security and Cryptography, Proceedings. INSTICC, Setúbal, Portugal, pp. 190-197, SECRYPT 2009 - International Conference on Security and Cryptography, Milan, Italy, 7/07/09.

Certified pseudonyms colligated with master secret key. / Pasupathinathan, Vijayakrishnan; Pieprzyk, Josef; Wang, Huaxiong.
SECRYPT 2009 - International Conference on Security and Cryptography, Proceedings. ed. / Eduardo Fernández-Medina; Manu Malek; Javier Hernando. Setúbal, Portugal: INSTICC, 2009. p. 190-197.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Certified pseudonyms colligated with master secret key

AU - Pasupathinathan, Vijayakrishnan

AU - Pieprzyk, Josef

AU - Wang, Huaxiong

PY - 2009

Y1 - 2009

N2 - A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.

AB - A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.

UR - http://www.scopus.com/inward/record.url?scp=74549153260&partnerID=8YFLogxK

M3 - Conference proceeding contribution

AN - SCOPUS:74549153260

SN - 9789896740054

SP - 190

EP - 197

BT - SECRYPT 2009 - International Conference on Security and Cryptography, Proceedings

A2 - Fernández-Medina, Eduardo

A2 - Malek, Manu

A2 - Hernando, Javier

PB - INSTICC

CY - Setúbal, Portugal

T2 - SECRYPT 2009 - International Conference on Security and Cryptography

Y2 - 7 July 2009 through 7 October 2009

ER -

Certified pseudonyms colligated with master secret key

Abstract

Other

Other files and links

Fingerprint

Cite this