{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:22:39Z","timestamp":1758709359331,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144226"},{"type":"electronic","value":"9783642144233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14423-3_19","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T12:13:34Z","timestamp":1276863214000},"page":"274-299","source":"Crossref","is-referenced-by-count":9,"title":["Secret Handshakes with Revocation Support"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Sorniotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Refik","family":"Molva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Ateniese, G., Blanton, M., Kirsch, J.: Secret handshakes with dynamic and fuzzy matching. In: Network and Distributed System Security Symposuim, February, pp. 159\u2013177. The Internet Society (2007); CERIAS TR 2007-24"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Camenisch, J., Hohenberger, S., de Medeiros, B.: Practical group signatures without random oracles (2005)","DOI":"10.1007\/978-3-540-30598-9_10"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/1455770.1455827","volume-title":"CCS 2008: Proceedings of the 15th ACM conference on Computer and communications security","author":"A. Bagherzandi","year":"2008","unstructured":"Bagherzandi, A., Cheon, J.-H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: CCS 2008: Proceedings of the 15th ACM conference on Computer and communications security, pp. 449\u2013458. ACM, New York (2008)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Baldwin, R.W., Gramlich, W.C.: Cryptographic protocol for trustable match making. In: IEEE Symposium on Security and Privacy (1985)","DOI":"10.1109\/SP.1985.10011"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Balfanz, D., Durfee, G., Shankar, N., Smetters, D.K., Staddon, J., Wong, H.-C.: Secret handshakes from pairing-based key agreements. In: IEEE Symposium on Security and Privacy, pp. 180\u2013196 (2003)","DOI":"10.1109\/SECPRI.2003.1199336"},{"key":"19_CR6","first-page":"274","volume-title":"One-way accumulators: A decentralized alternative to digital signatures","author":"J. Benaloh","year":"1993","unstructured":"Benaloh, J., Automation, G.: One-way accumulators: A decentralized alternative to digital signatures, pp. 274\u2013285. Springer, Heidelberg (1993)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the sdh assumption in bilinear groups. J. Cryptology\u00a021(2), 149\u2013177 (2008)","journal-title":"J. Cryptology"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30539-2_21","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"C. Castelluccia","year":"2004","unstructured":"Castelluccia, C., Jarecki, S., Tsudik, G.: Secret handshakes from ca-oblivious encryption. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 293\u2013307. Springer, Heidelberg (2004)"},{"key":"19_CR11","unstructured":"Changshe Ma, J.W., Zheng, D.: Fast digital signature schemes as secure as diffie-hellman assumptions. Cryptology ePrint Archive, Report 2007\/019 (2007)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-73275-4_3","volume-title":"Security and Privacy in Ad-hoc and Sensor Networks","author":"J.-H. Hoepman","year":"2007","unstructured":"Hoepman, J.-H.: Private handshakes. In: Stajano, F., Meadows, C., Capkun, S., Moore, T. (eds.) ESAS 2007. LNCS, vol.\u00a04572, pp. 31\u201342. Springer, Heidelberg (2007)"},{"key":"19_CR13","unstructured":"Jain, G.: Zero knowledge proofs: A survey (2008)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-79263-5_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"S. Jarecki","year":"2008","unstructured":"Jarecki, S., Kim, J., Tsudik, G.: Beyond secret handshakes: Affiliation-hiding authenticated key exchange. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 352\u2013369. Springer, Heidelberg (2008)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-72738-5_18","volume-title":"Applied Cryptography and Network Security","author":"S. Jarecki","year":"2007","unstructured":"Jarecki, S., Liu, X.: Unlinkable secret handshakes and key-private group key management schemes. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 270\u2013287. Springer, Heidelberg (2007)"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00446-004-0116-1","volume":"17","author":"N. Li","year":"2005","unstructured":"Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. Distrib. Comput.\u00a017(4), 293\u2013302 (2005)","journal-title":"Distrib. Comput."},{"key":"19_CR17","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)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. sp, 134 (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11889663_19","volume-title":"Financial Cryptography and Data Security","author":"S. Nasserian","year":"2006","unstructured":"Nasserian, S., Tsudik, G.: Revisiting oblivious signaturebased envelopes: New constructs and properties. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 221\u2013235. Springer, Heidelberg (2006)"},{"key":"19_CR20","first-page":"480","volume-title":"Collision-free accumulators and fail-stop signature schemes without trees","author":"B. Pfitzmann","year":"1997","unstructured":"Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees, pp. 480\u2013494. Springer, Heidelberg (1997)"},{"key":"19_CR21","unstructured":"Shin, J.S., Gligor, V.D.: A new privacy-enhanced matchmaking protocol. In: Network and Distributed System Security Symposuim, February 2007. The Internet Society (2007)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Sorniotti, A., Molva, R.: A provably secure secret handshake with dynamic controlled matching. In: Proceedings of The 24th International Information IFIP SEC 2009, Paphos, Cyprus, May 18-20 (2009)","DOI":"10.1007\/978-3-642-01244-0_29"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-76969-9_4","volume-title":"Cryptology and Network Security","author":"R. Tso","year":"2007","unstructured":"Tso, R., Gu, C., Okamoto, T., Okamoto, E.: Efficient id-based digital signatures with message recovery. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol.\u00a04856, pp. 47\u201359. Springer, Heidelberg (2007)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11779360_21","volume-title":"Coding and Cryptography","author":"D. Vergnaud","year":"2006","unstructured":"Vergnaud, D.: Rsa-based secret handshakes. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 252\u2013274. Springer, Heidelberg (2006)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Xu, S., Yung, M.: k-anonymous secret handshakes with reusable credentials. In: CCS 2004: Proceedings of the 11th ACM conference on Computer and communications security (2004)","DOI":"10.1145\/1030083.1030105"},{"key":"19_CR28","unstructured":"Zhang, K., Needham, R.: A private matchmaking protocol (2001)"}],"container-title":["Lecture Notes in Computer Science","Information, Security and Cryptology \u2013 ICISC 2009"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14423-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T02:30:47Z","timestamp":1740191447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14423-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144226","9783642144233"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14423-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}