{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:13:33Z","timestamp":1758266013840,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075358"},{"type":"electronic","value":"9783319075365"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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-319-07536-5_12","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T19:14:16Z","timestamp":1401909256000},"page":"181-198","source":"Crossref","is-referenced-by-count":2,"title":["All-but-One Dual Projective Hashing and Its Applications"],"prefix":"10.1007","author":[{"given":"Zongyang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Yunlei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-03356-8_39","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Abdalla","year":"2009","unstructured":"Abdalla, M., Chevalier, C., Pointcheval, D.: Smooth Projective Hashing for Conditionally Extractable Commitments. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 671\u2013689. Springer, Heidelberg (2009)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and Efficiently Searchable Encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-10366-7_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Brakerski, Z., Naor, M., Ristenpart, T., Segev, G., Shacham, H., Yilek, S.: Hedged Public-Key Encryption: How to Protect against Bad Randomness. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 232\u2013249. Springer, Heidelberg (2009)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-85174-5_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 360\u2013378. Springer, Heidelberg (2008)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01001-9_1","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 1\u201335. Springer, Heidelberg (2009)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-28914-9_6","volume-title":"Theory of Cryptography","author":"O. Blazy","year":"2012","unstructured":"Blazy, O., Pointcheval, D., Vergnaud, D.: Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 94\u2013111. Springer, Heidelberg (2012)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-22792-9_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z. Brakerski","year":"2011","unstructured":"Brakerski, Z., Segev, G.: Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 543\u2013560. Springer, Heidelberg (2011)"},{"key":"12_CR9","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":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10207-010-0119-9","volume":"9","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of Paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Sec.\u00a09(6), 371\u2013385 (2010)","journal-title":"Int. J. Inf. Sec."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable Cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-011-9112-3","volume":"26","author":"D.M. Freeman","year":"2013","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. J. Cryptology\u00a026(1), 39\u201374 (2013)","journal-title":"J. Cryptology"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-28914-9_33","volume-title":"Theory of Cryptography","author":"B. Fuller","year":"2012","unstructured":"Fuller, B., O\u2019Neill, A., Reyzin, L.: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 582\u2013599. Springer, Heidelberg (2012)"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/1151414.1151418","volume":"9","author":"R. Gennaro","year":"2006","unstructured":"Gennaro, R., Lindell, Y.: A framework for password-based authenticated key exchange. ACM Trans. Inf. Syst. Secur.\u00a09(2), 181\u2013234 (2006)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork, C. (ed.) STOC, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S. Halevi","year":"2012","unstructured":"Halevi, S., Kalai, Y.T.: Smooth Projective Hashing and Two-Message Oblivious Transfer. J. Cryptology\u00a025(1), 158\u2013193 (2012)","journal-title":"J. Cryptology"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M. Joye","year":"2013","unstructured":"Joye, M., Libert, B.: Efficient Cryptosystems from 2\n                    k\n                  -th Power Residue Symbols. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 76\u201392. Springer, Heidelberg (2013)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-10366-7_37","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"J. Katz","year":"2009","unstructured":"Katz, J., Vaikuntanathan, V.: Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 636\u2013652. Springer, Heidelberg (2009)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-642-29011-4_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"I. Mironov","year":"2012","unstructured":"Mironov, I., Pandey, O., Reingold, O., Segev, G.: Incremental Deterministic Public-Key Encryption. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 628\u2013644. Springer, Heidelberg (2012)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-Key Cryptosystems Resilient to Key Leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 18\u201335. Springer, Heidelberg (2009)"},{"issue":"6","key":"12_CR22","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C. Peikert","year":"2011","unstructured":"Peikert, C., Waters, B.: Lossy Trapdoor Functions and Their Applications. SIAM J. Comput.\u00a040(6), 1803\u20131844 (2011)","journal-title":"SIAM J. Comput."},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-38348-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"A. Raghunathan","year":"2013","unstructured":"Raghunathan, A., Segev, G., Vadhan, S.P.: Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 93\u2013110. Springer, Heidelberg (2013)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-14623-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Wee","year":"2010","unstructured":"Wee, H.: Efficient Chosen-Ciphertext Security via Extractable Hash Proofs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 314\u2013332. Springer, Heidelberg (2010)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-29011-4_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"H. Wee","year":"2012","unstructured":"Wee, H.: Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 246\u2013262. Springer, Heidelberg (2012)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Wichs, D.: Barriers in cryptography with weak, correlated and leaky sources. In: Kleinberg, R.D. (ed.) ITCS, pp. 111\u2013126. ACM (2013)","DOI":"10.1145\/2422436.2422451"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07536-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T20:10:19Z","timestamp":1558901419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07536-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075358","9783319075365"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07536-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}