{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:34Z","timestamp":1778127994633,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642546303","type":"print"},{"value":"9783642546310","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_35","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T05:04:17Z","timestamp":1392872657000},"page":"611-629","source":"Crossref","is-referenced-by-count":7,"title":["Practical Covert Authentication"],"prefix":"10.1007","author":[{"given":"Stanislaw","family":"Jarecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"G. Ateniese","year":"2000","unstructured":"Ateniese, G., Camenisch, J.L., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 255\u2013270. Springer, Heidelberg (2000)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: A modular approach to the design and analysis of authentication and key exchange protocols. In: STOC 1998, pp. 419\u2013428 (1998)","DOI":"10.1145\/276698.276854"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multisignatures in the plain publickey model and a general forking lemma. In: Proceedings of ACM CCS (2006)","DOI":"10.1145\/1180405.1180453"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM Conference on Computer and Communications Security, pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Ostrovsky, R., Sahai, A.: Covert multi-party computation. In: FOCS, pp. 238\u2013248 (2007)","DOI":"10.1109\/FOCS.2007.61"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer, Heidelberg (2001)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J.L. Camenisch","year":"1999","unstructured":"Camenisch, J.L., Michels, M.: Proving in zero-knowledge that a number is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 107\u2013122. Springer, Heidelberg (1999)"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-48910-X_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 74\u201389. Springer, Heidelberg (1999)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G.: Private selective payment protocols. In: Financial Cryptography, pp. 72\u201389 (2000)","DOI":"10.1007\/3-540-45472-1_6"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and and a paradigm for adaptive chosen ciphertext secure public-key encryption. Electronic Colloquium on Computational Complexity (ECCC)\u00a08(072) (2001)","DOI":"10.7146\/brics.v8i37.21697"},{"key":"35_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":"35_CR12","unstructured":"Ivan Damgard. On \u03a3-protocols (2010), \n                    \n                      http:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Goyal, V., Jain, A.: On the round complexity of covert computation. In: STOC (2010)","DOI":"10.1145\/1806689.1806717"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45708-9_6","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"N.J. Hopper","year":"2002","unstructured":"Hopper, N.J., Langford, J., von Ahn, L.: Provably secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 77\u201392. Springer, Heidelberg (2002)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-03356-8_6","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"S. Jarecki","year":"2009","unstructured":"Jarecki, S., Liu, X.: Private mutual authentication and conditional oblivious transfer. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 90\u2013107. Springer, Heidelberg (2009)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BFb0055727","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"J. Kilian","year":"1998","unstructured":"Kilian, J., Petrank, E.: Identity escrow. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 169\u2013185. Springer, Heidelberg (1998)"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-24676-3_20","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"L. Ahn von","year":"2004","unstructured":"von Ahn, L., Hopper, N.J.: Public-key steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 323\u2013341. Springer, Heidelberg (2004)"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"von Ahn, L., Hopper, N.J., Langford, J.: Covert two-party computation. In: STOC, pp. 513\u2013522 (2005)","DOI":"10.1145\/1060590.1060668"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T04:44:26Z","timestamp":1558845866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}