{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:42:39Z","timestamp":1649014959465},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1007\/s11390-007-9102-y","type":"journal-article","created":{"date-parts":[[2007,11,17]],"date-time":"2007-11-17T03:02:53Z","timestamp":1195268573000},"page":"805-821","source":"Crossref","is-referenced-by-count":0,"title":["Short Group Signatures Without Random Oracles"],"prefix":"10.1007","volume":"22","author":[{"given":"Bo","family":"Qin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian-Hong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Min","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng-Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,17]]},"reference":[{"key":"9102_CR1","doi-asserted-by":"crossref","unstructured":"D Chaum, E van Heyst. Group signatures. In Proc. Eurocrypt\u201991, Brighton, UK, LNCS 547, April 8\u201311, 1991, Springer-Verlag, pp.257\u2013265.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"9102_CR2","doi-asserted-by":"crossref","unstructured":"Au M H, Chow S S M, Susilo W. Short e-cash. In Proc. Idocrypt\u201905, Hyderabad, India, December 15\u201318, 2002, LNCS 3797, Springer-Verlag, 2005, pp.332\u2013346.","DOI":"10.1007\/11596219_27"},{"key":"9102_CR3","doi-asserted-by":"crossref","unstructured":"Wong D S. Security analysis of two anonymous authentication protocols for distributed wireless networks. In Proc. PerCom Workshops 2005, Kauai Island, HI, USA, March 8\u201312, 2005, IEEE Computer Society, 2005, pp.284\u2013288.","DOI":"10.1109\/PERCOMW.2005.70"},{"key":"9102_CR4","doi-asserted-by":"crossref","unstructured":"Bellare M, Micciancio D, Warinschi B. Foundations of group signatures: Formal definition, simplified requirements and a construction based on general assumptions. In Proc. Eurocrypt\u201903, Warsaw, Poland, May 4\u20138, 2003, LNCS 2656, Springer-Verlag, 2003, pp.614\u2013629.","DOI":"10.1007\/3-540-39200-9_38"},{"key":"9102_CR5","unstructured":"Kiayias A, Yung M. Group signatures: Provable security, efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive: 2004\/076, 2004, http:\/\/eprint.iacr.org\/ ."},{"key":"9102_CR6","doi-asserted-by":"crossref","unstructured":"Ateniese G, Camenisch J, Hohenberger S et al. Practical group signatures without random oracles. Cryptology ePrint Archive, Report 2005\/385, 2005, http:\/\/eprint.iacr.org\/ .","DOI":"10.1007\/978-3-540-30598-9_10"},{"key":"9102_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D, Boyen X, Shacham H. Short group signatures. In Proc. Crypto\u201904, Santa Barbara, California, USA, August 15\u201319, 2004, LNCS 3152, Springer-Verlag, 2004, pp.41\u201355.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9102_CR8","doi-asserted-by":"crossref","unstructured":"Ateniese G, Camenisch J, Joye M, Tsudik G. A practical and provably secure coalition-resistant group signature scheme. In Proc. Crypto\u201900, Santa Barbara, California, USA, August 20\u201324, 2000, LNCS 1880, Springer-Verlag, 2000, pp.255\u2013270.","DOI":"10.1007\/3-540-44598-6_16"},{"issue":"2","key":"9102_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s11390-005-0270-3","volume":"20","author":"Q Wu","year":"2005","unstructured":"Wu Q, Qin B, Wang Y. Extended methodology of RS design and instances based on GIP. Journal of Computer Science and Technology, 2005, 20(2): 270\u2013275.","journal-title":"Journal of Computer Science and Technology"},{"key":"9102_CR10","doi-asserted-by":"crossref","unstructured":"Camenisch J, Lysyanskaya A. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Proc. Crypto\u201902, Santa Barbara, California, USA, August 18\u201322, 2002, LNCS 2442, Springer-Verlag, 2002, pp.61\u201376.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"9102_CR11","doi-asserted-by":"crossref","unstructured":"Liu J K, Wei V K, Wong D S. Linkable spontaneous anonymous group signature for Ad Hoc groups (Extended Abstract). In Proc. ACISP\u201904, Sydney, Australia, July 13\u201315, 2004, LNCS 3108, Springer-Verlag, 2004, pp.325\u2013335.","DOI":"10.1007\/978-3-540-27800-9_28"},{"key":"9102_CR12","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM CCS, Fairfax, Virginia, USA, November 3\u20135, 1993, ACM Press, 1993, pp.62\u201373.","DOI":"10.1145\/168588.168596"},{"key":"9102_CR13","doi-asserted-by":"crossref","unstructured":"Boneh D, Boyen X. Short signatures without random oracles. In Proc. Eurocrypt\u201904, Interlaken, Switzerland, 2\u20136 May 2004, LNCS 3027, Springer-Verlag, pp.56\u201373.","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"9102_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch J, Lysyanskaya A. Signature schemes and anonymous credentials from bilinear maps. In Proc. Crypto\u201904, Santa Barbara, California, USA, August 15\u201319, 2004, LNCS 3152, Springer-Verlag, pp.56\u201372.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"9102_CR15","doi-asserted-by":"crossref","unstructured":"Lysyanskaya A, Rivest R L, Sahai A et al. Pseudonym systems. In Proc. SAC\u201999, San Antonio, Texas, USA, February 28\u2013March 2, 1999, LNCS 1758, Springer-Verlag, pp.184\u2013199.","DOI":"10.1007\/3-540-46513-8_14"},{"key":"9102_CR16","doi-asserted-by":"crossref","unstructured":"Barak B. How to go beyond the black-box simulation barrier. In Proc. 42nd FOCS, Las Vegas, Nevada, USA, October 14\u201317, 2001, IEEE Computer Society, pp.106\u2013115, Also http:\/\/www.wisdom.weizmann.ac.il\/boaz .","DOI":"10.1109\/SFCS.2001.959885"},{"key":"9102_CR17","doi-asserted-by":"crossref","unstructured":"Barak B, Lindell Y, Vadhan S P. Lower bounds for non-black-box zero knowledge. In Proc. FOCS\u201903, Cambridge, MA, USA, October 11\u201314, 2003, IEEE Computer Society, pp.384\u2013393.","DOI":"10.1109\/SFCS.2003.1238212"},{"key":"9102_CR18","doi-asserted-by":"crossref","unstructured":"Boyen X, Waters B. Compact group signatures without random oracles. In Proc. Eurocrypt\u201906, Saint Petersburg, Russia, May 28\u2013June 1, 2006, LNCS 4004, Springer-Verlag, pp.427\u2013444.","DOI":"10.1007\/11761679_26"},{"key":"9102_CR19","unstructured":"Waters B. Efficient identity-based encryption without random oracles. In Proc. Eurocrypt\u201905, %Saint Petersburg, Russia, May %28 \u2013 June 1, 2006, Aarhus, Denmark, May 22\u201326, 2005, LNCS 3494, Springer-Verlag, pp.457\u2013473."},{"key":"9102_CR20","doi-asserted-by":"crossref","unstructured":"Groth J, Ostrovsky R, Sahai A. Perfect non-interactive zero knowledge for NP. In Proc. of Eurocypt\u201906, Saint Petersburg, Russia, May 28 \u2013 June 1, 2006, LNCS 4004, Springer-Verlag, 2006, pp.339\u2013358.","DOI":"10.1007\/11761679_21"},{"key":"9102_CR21","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh E J, Nissim K. Evaluating 2-DNF formulas on ciphertexts. In Proc. TCC\u201905, Cambridge, MA, USA, Feb. 10\u201312, 2005, LNCS 3378, Springer-Verlag, 2005, pp.325\u2013341.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"9102_CR22","doi-asserted-by":"crossref","unstructured":"G Ateniese, J Camenisch, B de Medeiros. Untraceable RFID tags via insubvertible encryption. In Proc. ACM CCS\u201905, Alexandria, VA, USA, November 7\u201311, 2005, ACM Press, pp.92\u2013101.","DOI":"10.1145\/1102120.1102134"},{"key":"9102_CR23","unstructured":"L Ballard, M Green, B de Medeiros, F Monrose. Correlation-resistant storage. Technical Report TR-SP-BGMM-050705, Johns Hopkins University, CS Dept, 2005. http:\/\/spar.isi.jhu.edu\/~mgreen\/correlation.pdf ."},{"key":"9102_CR24","doi-asserted-by":"crossref","unstructured":"Canetti R. Universally composable security: A new paradigm for cryptographic protocols. In Proc. FOCS\u201901, Las Vegas, Nevada, USA, October 14\u201317, 2001, IEEE Computer Society, pp.136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9102_CR25","doi-asserted-by":"crossref","unstructured":"Pfitzmann B, Waidner M. Composition and integrity preservation of secure reactive systems. In Proc. ACM CCS\u201900, November 1\u20134, 2000, Athens, Greece, ACM Press, 2000, pp.245\u2013254.","DOI":"10.1145\/352600.352639"},{"key":"9102_CR26","doi-asserted-by":"crossref","unstructured":"Pfitzmann B, Waidner M. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. 22nd IEEE Symp. Security Privacy 2001, Oakland, California, USA, May 13\u201316, 2001, IEEE Computer Society, pp.184\u2013200.","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"9102_CR27","doi-asserted-by":"crossref","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In Proc. Asiacrypt\u201901, Gold Coast, Australia, December 9\u201313, 2001, LNCS 2248, Springer-Verlag, pp.514\u2013532.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"9102_CR28","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, 2004, 7: 201\u2013218.","journal-title":"Journal of Computation and Mathematics"},{"key":"9102_CR29","doi-asserted-by":"crossref","unstructured":"Verheul E R. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In Proc. Eurocrypt\u201901, Innsbruck, Austria, May 6\u201310, 2001, LNCS 2045, Springer-Verlag, pp.195\u2013210.","DOI":"10.1007\/3-540-44987-6_13"},{"key":"9102_CR30","unstructured":"Galbraith S D, Paterson K G, Smart N P. Pairings for cryptographers. Cryptology ePrint Archive, Report 2006\/165, 2006. http:\/\/eprint.iacr.org\/ ."},{"key":"9102_CR31","doi-asserted-by":"crossref","unstructured":"Zhang F, Chen X, Susilo W, Mu Y. A new short signature scheme without random oracles from bilinear pairings. In Proc. VietCrypt\u201906, Hanoi, Vietnam, Sept. 25\u201328, 2006, LNCS 4341, Springer Verlag, pp.67\u201380.","DOI":"10.1007\/11958239_5"},{"key":"9102_CR32","unstructured":"Adida B, Hohenberger S, Rivest R L. Ad-hoc-group signatures from hijacked keypairs, 2005. At http:\/\/ theory.lcs.mit.edu\/rivest\/publications ."},{"key":"9102_CR33","unstructured":"Scott M. MIRACL library. Indigo Software. http:\/\/indigo.ie\/mScott\/#download ."},{"key":"9102_CR34","doi-asserted-by":"crossref","unstructured":"Brickell E, Camenisch J, Chen L. Direct anonymous attestation. In Proc. ACM CCS\u201904, Washington DC, USA, Oct. 25\u201329, 2004, ACM Press, pp.132\u2013145.","DOI":"10.1145\/1030083.1030103"},{"key":"9102_CR35","doi-asserted-by":"crossref","unstructured":"Bellare M, Palacio A. GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In Proc. Crypto\u201902, Santa Barbara, California, USA, August 18\u201322, 2002, LNCS 2442, Springer-Verlag, pp.162\u2013177.","DOI":"10.1007\/3-540-45708-9_11"},{"issue":"2","key":"9102_CR36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02113297","volume":"55","author":"V I Nechaev","year":"February 1994","unstructured":"Nechaev V I. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, February 1994, 55(2): 91\u2013101.","journal-title":"Mathematical Notes"},{"key":"9102_CR37","doi-asserted-by":"crossref","unstructured":"Shoup V. Lower bounds for discrete logarithms and related problems. In Proc. Eurocrypt\u201997, Konstanz, Germany, May 11\u201315, 1997, LNCS 1233, Springer-Verlag, 1997, pp.256\u2013266.","DOI":"10.1007\/3-540-69053-0_18"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9102-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9102-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9102-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:39Z","timestamp":1559399559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9102-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["9102"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9102-y","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}