{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:10:31Z","timestamp":1725531031920},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642014390"},{"type":"electronic","value":"9783642014406"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01440-6_9","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T12:45:40Z","timestamp":1240922740000},"page":"84-95","source":"Crossref","is-referenced-by-count":1,"title":["Privacy for Private Key in Signatures"],"prefix":"10.1007","author":[{"given":"Qianhong","family":"Wu","sequence":"first","affiliation":[]},{"given":"Bo","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44929-9_1","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"M. Abadi","year":"2000","unstructured":"Abadi, M., Rogaway, P.: Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 3\u201322. Springer, Heidelberg (2000)"},{"key":"9_CR2","first-page":"92","volume-title":"ACM CCS 2005","author":"G. Ateniese","year":"2005","unstructured":"Ateniese, G., Camenisch, J., de Medeiros, B.: Untraceable RFID Tags via Insubvertible Encryption. In: Meadows, C. (ed.) ACM CCS 2005, pp. 92\u2013101. ACM Press, New York (2005)"},{"key":"9_CR3","unstructured":"Ballard, L., Green, M., de Medeiros, B., Monrose, F.: Correlation-resistant Storage. Technical Report TR-SP-BGMM-050705, Johns Hopkins University (2005), http:\/\/spar.isi.jhu.edu\/~mgreen\/correlation.pdf"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Bellare","year":"2001","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 566\u2013582. Springer, Heidelberg (2001)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption-How to Encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"9_CR9","first-page":"132","volume-title":"ACM CCS 2004","author":"E. Brickell","year":"2004","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct Anonymous Attestation. In: Pfitzmann, B. (ed.) ACM CCS 2004, pp. 132\u2013145. ACM Press, New York (2004)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J.L. Camenisch","year":"2004","unstructured":"Camenisch, J.L., Lysyanskaya, A.: Signature Schemes and Anonymous Credentials from Bilinear Maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"D. Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 257\u2013265. Springer, Heidelberg (1991)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-44598-6_23","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Desai","year":"2000","unstructured":"Desai, A.: The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 359\u2013375. Springer, Heidelberg (2000)"},{"key":"9_CR14","first-page":"467","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public Key Cryptosystem and Signature Scheme Based on Discrete Logarithms. IEEE Transaction on Information Theory\u00a031, 467\u2013472 (1985)","journal-title":"IEEE Transaction on Information Theory"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-48910-X_30","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"M. Fischlin","year":"1999","unstructured":"Fischlin, M.: Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 432\u2013445. Springer, Heidelberg (1999)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-36288-6_9","volume-title":"Public Key Cryptography - PKC 2003","author":"M. Fischlin","year":"2002","unstructured":"Fischlin, M.: The Cramer-Shoup Strong-RSASignature Scheme Revisited. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 116\u2013129. Springer, Heidelberg (2002)"},{"key":"9_CR17","first-page":"201","volume":"7","author":"S.-D. Galbraith","year":"2004","unstructured":"Galbraith, S.-D., Rotger, V.: Easy Decision Diffie-Hellman Groups. Journal of Computation and Mathematics\u00a07, 201\u2013218 (2004)","journal-title":"Journal of Computation and Mathematics"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Halevi, S., Rabin, T.: Secure Hash-and-Sign Signatures without the Random Oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 123\u2013139. Springer, Heidelberg (1999)"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure against Adaptive Chosen-message Attacks. SIAM J. Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Computing"},{"key":"9_CR20","unstructured":"Halevi, S.: A Sufficient Condition for Key-privacy. Technique report (2005), http:\/\/eprint.iacr.org\/"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A. Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym Systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 184\u2013199. Springer, Heidelberg (2000)"},{"issue":"5","key":"9_CR22","first-page":"1234","volume":"E84-A","author":"A. Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New Explicit Conditions of Elliptic Curves for FR-reduction. IEICE Transactions on Fundamentals\u00a0E84-A(5), 1234\u20131243 (2001)","journal-title":"IEICE Transactions on Fundamentals"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"R.L. Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to Leak a Secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 552\u2013565. Springer, Heidelberg (2001)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.-P. Schnorr","year":"1990","unstructured":"Schnorr, C.-P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-44987-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 195\u2013210. Springer, Heidelberg (2001)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Wu, Q., Qin, B., Mu, Y., Susilo, W.: Privacy for Private Key in Signatures. Full version (2009), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-01440-6_9"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11745853_23","volume-title":"Public Key Cryptography - PKC 2006","author":"G. Yang","year":"2006","unstructured":"Yang, G., Wong, D., Deng, X., Wang, H.: Anonymous Signature Schemes. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 347\u2013363. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01440-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:47:59Z","timestamp":1558291679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01440-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642014390","9783642014406"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01440-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}