{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:42Z","timestamp":1725488262857},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432241"},{"type":"electronic","value":"9783540457602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45760-7_12","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:11:12Z","timestamp":1184962272000},"page":"164-181","source":"Crossref","is-referenced-by-count":6,"title":["Proprietary Certificates"],"prefix":"10.1007","author":[{"given":"Markus","family":"Jakobsson","sequence":"first","affiliation":[]},{"given":"Ari","family":"Juels","sequence":"additional","affiliation":[]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"The decision Diffie-Hellman problem","author":"D. Boneh","year":"1998","unstructured":"D. Boneh. The decision Diffie-Hellman problem. In Proc. of ANTS-III, volume 1423 of LNCS, pages 48\u201363. Springer-Verlag, 1998."},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-540-47942-0_8","volume-title":"ICICS\u2019 99","author":"F. Boudot","year":"1999","unstructured":"F. Boudot and J. Traor\u00e9. Efficient publicly verifiable secret sharing schemes with fast or delayed recovery. In ICICS\u2019 99, volume 1726 of LNCS, pages 87\u2013102. Springer-Verlag, 1999."},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund. Practical zero-knowledge proofs: Giving hints and using deficiencies. Journal of Cryptology, 4(3):185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Eurocrypt\u2019 01","author":"J. Camenisch","year":"2001","unstructured":"J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In B. Pfitzmann, editor, Eurocrypt\u2019 01, volume 2045 of LNCS, pages 93\u2013117. Springer-Verlag, 2001."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume-title":"Crypto\u2019 99","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In M. Wiener, editor, Crypto\u2019 99, volume 1666 of LNCS, pages 413\u2013430. Springer-Verlag, 1999."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Q. Nguyen. Paillier\u2019s cryptosystem revisited. In P. Samarati, editor, 8th ACM Conference on Computer and Communications Security. ACM Press, 2001. To appear.","DOI":"10.1145\/501983.502012"},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","first-page":"212","volume-title":"Crypto\u2019 89","author":"D. Chaum","year":"1989","unstructured":"D. Chaum and H. Van Antwerpen. Undeniable signatures. In G. Brassard, editor, Crypto\u2019 89, volume 435 of LNCS, pages 212\u2013216. Springer-Verlag, 1989."},{"key":"12_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"PKC\u2019 01","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd and M. Jurik. A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In PKC\u2019 01, volume 1992 of LNCS, pages 119\u2013136. Springer-Verlag, 2001."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Lotspiech, and M. Naor. Digital signets: Self-enforcing protection of digital information. In Proc. of 28th STOC, pages 489\u2013498. ACM, 1996.","DOI":"10.1145\/237814.237997"},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Eurocrypt\u2019 98","author":"E. Fujisaki","year":"1998","unstructured":"E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In K. Nyberg, editor, Eurocrypt\u2019 98, volume 1403 of LNCS, pages 32\u201346. Springer-Verlag, 1998."},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1137\/0218049","volume":"18","author":"Z. Galil","year":"1989","unstructured":"Z. Galil, S. Haber, and M. Yung. Minimum-knowledge interactive proofs for decision problems. Siam J. of Computing, 18(4):711\u2013739, 1989.","journal-title":"Siam J. of Computing"},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0052232","volume-title":"Crypto\u2019 97","author":"R. Gennaro","year":"1997","unstructured":"R. Gennaro, H. Krawczyk, and T. Rabin. RSA-based undeniable signatures. In B. Kaliski, editor, Crypto\u2019 97, volume 1294 of LNCS, pages 132\u2013149. Springer-Verlag, 1997."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"R. Gennaro, D. Micciancio, and T. Rabin. An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In 5th ACM Conference on Computer and Communications Security, pages 67\u201372. ACM Press, 1998.","DOI":"10.1145\/288090.288108"},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BFb0055726","volume-title":"Crypto\u2019 98","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, B. Pfitzmann, and R. L. Rivest. Self-delegation with controlled propagation-or what if you lose your laptop. In H. Krawczyk, editor, Crypto\u2019 98, volume 1462 of LNCS, pages 153\u2013168. Springer-Verlag, 1998."},{"key":"12_CR15","series-title":"Lect Notes Comput Sci","first-page":"128","volume-title":"Crypto\u2019 87","author":"J. Graaf van de","year":"1987","unstructured":"J. van de Graaf and R. Peralta. A simple and secure way to show the validity of your public key. In B. Kaliski, editor, Crypto\u2019 87, volume 293 of LNCS, pages 128\u2013134. Springer-Verlag, 1987."},{"key":"12_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Eurocrypt\u2019 96","author":"M. Jakobsson","year":"1996","unstructured":"M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In U. Maurer, editor, Eurocrypt\u2019 96, LNCS, pages 143\u2013154. Springer-Verlag, 1996."},{"key":"12_CR17","unstructured":"S. Katezenbeisser and F.A.P. Petitcolas, editors. Information Hiding Techniques for Steganography and Digital Watermarking. Artech House, 1999."},{"key":"12_CR18","unstructured":"National Institute of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard, May 1994."},{"key":"12_CR19","unstructured":"Bloomberg News. Ad-revenue worries weigh down Yahoo. 1 September 2000. URL: http:\/\/yahoo.cnet.com\/news\/0-1005-200-2670551.html ."},{"key":"12_CR20","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Eurocrypt\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In J. Stern, editor, Eurocrypt\u2019 99, volume 1592 of LNCS, pages 223\u2013238. Springer-Verlag, 1999."},{"key":"12_CR21","series-title":"Lect Notes Comput Sci","first-page":"173","volume-title":"Eurocrypt\u2019 00","author":"G. Poupard","year":"2000","unstructured":"G. Poupard and J. Stern. Fair encryption of RSA keys. In B. Preneel, editor, Eurocrypt\u2019 00, volume 1807 of LNCS, pages 173\u2013190. Springer-Verlag, 2000."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161\u2013174, 1991.","journal-title":"Journal of Cryptology"},{"key":"12_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0054114","volume-title":"Eurocrypt\u2019 98","author":"A. Young","year":"1998","unstructured":"A. Young and M. Yung. Auto-recoverable auto-certifiable cryptosystems. In K. Nyberg, editor, Eurocrypt\u2019 98, volume 1403 of LNCS, pages 17\u201331. Springer-Verlag, 1998."}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45760-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:07:02Z","timestamp":1556708822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45760-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432241","9783540457602"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45760-7_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}