IBM / G1 / ACM Press / G. Bilinear Maps / G2 / Dupont / Zurich Research Laboratory / GT / /
Country
Switzerland / Belgium / United States / / /
Facility
Brown University / /
IndustryTerm
particular car / generation algorithm / signature protocol / e-tokens / bilinear groups / basic solution / hash tree protocol / e-token / secure solution / on-line game / on-line game scenario / on-line authority / e-cash / jth time protocol / proof protocol / given software license / prior solution / naive solution / withdrawal protocol / /
Organization
Brown University / Computer Science Department / Katholieke Universiteit Leuven / /
Person
Anna Lysyanskaya / Jan Camenisch∗ Susan Hohenberger / Mira Meyerovich Anna / Susan Hohenberger†Markulf Kohlweiss / /
Position
anonymity revoking trustee / player / knowledge extractor / common parameters model / these parameters params / /
ProgrammingLanguage
R / /
ProvinceOrState
Rhode Island / /
Technology
Obtain protocol / Show protocol / hash tree protocol / corresponding algorithms / PKI / Bilinear El Gamal Encryption / two protocols / Encryption / key generation algorithm / public key / withdrawal protocol / jth time protocol / signature protocol / Show protocols / following algorithms / using the hash tree protocol / using the following algorithms / /
Full version of an extended abstract published in Proceedings of ACM CCS 2006, ACM Press, 2006. Available from the IACR Cryptology ePrint Archive as ReportHow to Win the Clone Wars: Efficient Periodic n-Times