{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T23:10:02Z","timestamp":1749769802848,"version":"3.41.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T00:00:00Z","timestamp":1480377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00145-016-9246-4","type":"journal-article","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T21:22:37Z","timestamp":1480454557000},"page":"1187-1237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reproducible Circularly Secure Bit Encryption: Applications and Realizations"],"prefix":"10.1007","volume":"30","author":[{"given":"Mohammad","family":"Hajiabadi","sequence":"first","affiliation":[]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,29]]},"reference":[{"key":"9246_CR1","doi-asserted-by":"crossref","unstructured":"A. Akavia, S. Goldwasser, and V. Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks, in O. Reingold, editor, Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15\u201317, 2009. Lecture Notes in Computer Science, vol. 5444 (Springer, 2009), pp. 474\u2013495","DOI":"10.1007\/978-3-642-00457-5_28"},{"issue":"3","key":"9246_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00145-013-9149-6","volume":"27","author":"B Applebaum","year":"2014","unstructured":"B. Applebaum. Key-dependent message security: Generic amplification and completeness. J. Cryptol., 27(3):429\u2013451, 2014","journal-title":"J. Cryptol."},{"key":"9246_CR3","doi-asserted-by":"crossref","unstructured":"B. Applebaum, D. Cash, C. Peikert, and A. Sahai. Fast cryptographic primitives and circular-secure encryption based on hard learning problems, in S. Halevi, editor, Proceedings of the Advances in Cryptology\u2014CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2009. Lecture Notes in Computer Science, vol. 5677 (Springer, 2009), pp. 595\u2013618","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"9246_CR4","doi-asserted-by":"crossref","unstructured":"B. Barak, I. Haitner, D. Hofheinz, and Y. Ishai. Bounded key-dependent message security, in H. Gilbert, editor, Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Lecture Notes in Computer Science, vol. 6110 (Springer, 2010), pp. 423\u2013444","DOI":"10.1007\/978-3-642-13190-5_22"},{"key":"9246_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, and A. ONeill. Deterministic and efficiently searchable encryption, in A. Menezes, editor, Proceedings of the Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2007. Lecture Notes in Computer Science, vol. 4622 (Springer, 2007), pp. 535\u2013552","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"9246_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, and J. Staddon. Randomness re-use in multi-recipient encryption schemeas, in Y. Desmedt, editor, Proceedings of the Public Key Cryptography\u2014PKC 2003, 6th International Workshop on Theory and Practice in Public Key Cryptography, Miami, FL, USA, January 6\u20138, 2003. Lecture Notes in Computer Science, vol. 2567 (Springer, 2003), pp. 85\u201399","DOI":"10.1007\/3-540-36288-6_7"},{"key":"9246_CR7","doi-asserted-by":"crossref","unstructured":"M. Bellare, M. Fischlin, A. ONeill, and T. Ristenpart. Deterministic encryption: Definitional equivalences and constructions without random oracles. In Wagner [41], pp. 360\u2013378","DOI":"10.1007\/978-3-540-85174-5_20"},{"key":"9246_CR8","doi-asserted-by":"crossref","unstructured":"E. Birrell, K.-M. Chung, R. Pass, and S. Telang. Randomness-dependent message security, in A. Sahai, editor, Proceedings of the Theory of Cryptography, The Tenth Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3\u20136, 2013. Lecture Notes in Computer Science, vol. 7785 (Springer, 2013), pp. 700\u2013720","DOI":"10.1007\/978-3-642-36594-2_39"},{"key":"9246_CR9","doi-asserted-by":"crossref","unstructured":"J. Black, P. Rogaway, and T. Shrimpton. Encryption-scheme security in the presence of key-dependent messages, in K. Nyberg and H.M. Heys, editors, Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, St. John\u2019s, Newfoundland, Canada, August 15\u201316, 2002. Revised Papers, Lecture Notes in Computer Science, vol. 2595 (Springer, 2002), pp. 62\u201375","DOI":"10.1007\/3-540-36492-7_6"},{"key":"9246_CR10","doi-asserted-by":"crossref","unstructured":"A. Boldyreva, S. Fehr, and A. ONeill. On notions of security for deterministic encryption, and efficient constructions without random oracles. In Wagner [41], pp. 335\u2013359","DOI":"10.1007\/978-3-540-85174-5_19"},{"issue":"5","key":"9246_CR11","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D Boneh","year":"2006","unstructured":"D. Boneh, R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. SIAM J. Comput., 36(5):1301\u20131328, 2006","journal-title":"SIAM J. Comput."},{"key":"9246_CR12","doi-asserted-by":"crossref","unstructured":"D. Boneh, S. Halevi, M. Hamburg, and R. Ostrovsky. Circular-secure encryption from decision diffie\u2013hellman. In Wagner [41], pp. 108\u2013125","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"9246_CR13","doi-asserted-by":"crossref","unstructured":"Z. Brakerski and S. Goldwasser. Circular and leakage resilient public-key encryption under subgroup indistinguishability\u2014(or: Quadratic residuosity strikes back), in T. Rabin, editor, Proceedings of the Advances in Cryptology\u2014CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15\u201319, 2010. Lecture Notes in Computer Science, vol. 6223 (Springer, 2010), pp. 1\u201320","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"9246_CR14","first-page":"485","volume":"2009","author":"Z Brakerski","year":"2009","unstructured":"Z. Brakerski, S. Goldwasser, and Y. T. Kalai. Black-box circular-secure encryption beyond affine functions. IACR Cryptol. ePrint Arch. 2009:485, 2009.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9246_CR15","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, S. Goldwasser, and Y.\u00a0T. Kalai. Black-box circular-secure encryption beyond affine functions, in Y. Ishai, editor, Proceedings of the Theory of Cryptography, 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28\u201330, 2011. Lecture Notes in Computer Science, vol. 6597 (Springer, 2011), pp. 201\u2013218","DOI":"10.1007\/978-3-642-19571-6_13"},{"issue":"2","key":"9246_CR16","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s00145-012-9143-4","volume":"27","author":"Z Brakerski","year":"2014","unstructured":"Z. Brakerski and G. Segev. Better security for deterministic public-key encryption: The auxiliary-input setting. J. Cryptol., 27(2):210\u2013247, 2014","journal-title":"J. Cryptol."},{"key":"9246_CR17","doi-asserted-by":"crossref","unstructured":"J. Camenisch, N. Chandran, and V. Shoup. A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks, in A. Joux, editor, Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26\u201330, 2009. Lecture Notes in Computer Science, vol. 5479 (Springer, Berlin, 2009), pp. 351\u2013368","DOI":"10.1007\/978-3-642-01001-9_20"},{"key":"9246_CR18","doi-asserted-by":"crossref","unstructured":"J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation, in B. Pfitzmann, editor, Proceeding of the Advances in Cryptology\u2014EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6\u201310, 2001. Lecture Notes in Computer Science, vol. 2045 (Springer, 2001), pp. 93\u2013118","DOI":"10.1007\/3-540-44987-6_7"},{"issue":"20","key":"9246_CR19","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.ipl.2012.07.012","volume":"112","author":"SG Choi","year":"2012","unstructured":"S.\u00a0G. Choi and H. Wee. Lossy trapdoor functions from homomorphic reproducible encryption. Inf. Process. Lett., 112(20):794\u2013798, 2012","journal-title":"Inf. Process. Lett."},{"key":"9246_CR20","doi-asserted-by":"crossref","unstructured":"Y. Dodis, S. Goldwasser, Y.\u00a0T. Kalai, C. Peikert, and V. Vaikuntanathan. Public-key encryption schemes with auxiliary inputs. In Micciancio [31], pp. 361\u2013381","DOI":"10.1007\/978-3-642-11799-2_22"},{"issue":"1","key":"9246_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., 38(1):97\u2013139, 2008","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9246_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-011-9112-3","volume":"26","author":"DM Freeman","year":"2013","unstructured":"D.\u00a0M. Freeman, O. Goldreich, E. Kiltz, A. Rosen, and G. Segev. More constructions of lossy and correlation-secure trapdoor functions. J. Cryptol., 26(1):39\u201374, 2013","journal-title":"J. Cryptol."},{"issue":"3","key":"9246_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s00145-013-9174-5","volume":"28","author":"B Fuller","year":"2015","unstructured":"B. Fuller, A. ONeill, and L. Reyzin. A unified approach to deterministic encryption: New constructions and a connection to computational entropy. J. Cryptol., 28(3):671\u2013717, 2015","journal-title":"J. Cryptol."},{"key":"9246_CR24","doi-asserted-by":"crossref","unstructured":"Y. Gertner, T. Malkin, and S. Myers. Towards a separation of semantic and CCA security for public key encryption, in S.P. Vadhan, editor, Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21\u201324, 2007. Lecture Notes in Computer Science, vol. 4392 (Springer, 2007), pp. 434\u2013455","DOI":"10.1007\/978-3-540-70936-7_24"},{"key":"9246_CR25","doi-asserted-by":"crossref","unstructured":"Y. Gertner, T. Malkin, and O. Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates, in M. Naor, editor, 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, Las Vegas, Nevada, USA, October 14\u201317, 2001 (IEEE Computer Society, 2001), pp. 126\u2013135","DOI":"10.1109\/SFCS.2001.959887"},{"key":"9246_CR26","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L.\u00a0A. Levin. A hard-core predicate for all one-way functions, in D.S. Johnson, editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washigton, USA, May 14\u201317, 1989 (ACM, 1989), pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"key":"9246_CR27","unstructured":"B. Hemenway and R. Ostrovsky. Building injective trapdoor functions from oblivious transfer. Electron. Colloq. Comput. Complex. (ECCC), 17:127, 2010"},{"key":"9246_CR28","doi-asserted-by":"crossref","unstructured":"B. Hemenway and R. Ostrovsky. Building lossy trapdoor functions from lossy encryption, in K. Sako and P. Sarkar, editors, Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2013, 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1\u20135, 2013. Lecture Notes in Computer Science, Part II, vol. 8270 (Springer, 2013), pp. 241\u2013260","DOI":"10.1007\/978-3-642-42045-0_13"},{"key":"9246_CR29","doi-asserted-by":"crossref","unstructured":"D. Hofheinz. Circular chosen-ciphertext security with compact ciphertexts, in T. Johansson and P.Q. Nguyen, editors, Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26\u201330, 2013. Lecture Notes in Computer Science, vol. 7881 (Springer, 2013), pp. 520\u2013536","DOI":"10.1007\/978-3-642-38348-9_31"},{"key":"9246_CR30","doi-asserted-by":"crossref","unstructured":"T. Malkin, I. Teranishi, and M. Yung. Efficient circuit-size independent public key encryption with KDM security, in K.G. Paterson, editor, Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15\u201319, 2011. Lecture Notes in Computer Science, vol. 6632 (Springer, 2011), pp. 507\u2013526","DOI":"10.1007\/978-3-642-20465-4_28"},{"key":"9246_CR31","doi-asserted-by":"crossref","unstructured":"D. Micciancio, editor. Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9\u201311, 2010. Lecture Notes in Computer Science, vol. 5978 (Springer, 2010)","DOI":"10.1007\/978-3-642-11799-2"},{"key":"9246_CR32","doi-asserted-by":"crossref","unstructured":"S. Myers and A. Shelat. Bit encryption is complete, in D. Spielman, editor, 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, Atlanta, Georgia, USA, October 25\u201327, 2009 (IEEE Computer Society, 2009), pp. 607\u2013616","DOI":"10.1109\/FOCS.2009.65"},{"issue":"4","key":"9246_CR33","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1137\/100813464","volume":"41","author":"M Naor","year":"2012","unstructured":"M. Naor and G. Segev. Public-key cryptosystems resilient to key leakage. SIAM J. Comput., 41(4):772\u2013814, 2012","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9246_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"N. Nisan and D. Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43\u201352, 1996","journal-title":"J. Comput. Syst. Sci."},{"key":"9246_CR35","doi-asserted-by":"crossref","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes, in J. Stern, editor, Proceeding of the Advances in Cryptology\u2014EUROCRYPT \u201999, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2\u20136, 1999. Lecture Notes in Computer Science, vol. 1592 (Springer, 1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"6","key":"9246_CR36","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"C. Peikert and B. Waters. Lossy trapdoor functions and their applications. SIAM J. Comput., 40(6):1803\u20131844, 2011","journal-title":"SIAM J. Comput."},{"key":"9246_CR37","doi-asserted-by":"crossref","unstructured":"O. Reingold, L. Trevisan, and S. Vadhan. Notions of reducibility between cryptographic primitives, in M. Naor, editor, Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19\u201321, 2004. Lecture Notes in Computer Science, vol. 2951 (Springer, 2004), pp. 1\u201320","DOI":"10.1007\/978-3-540-24638-1_1"},{"issue":"7","key":"9246_CR38","doi-asserted-by":"publisher","first-page":"3058","DOI":"10.1137\/100782929","volume":"39","author":"A Rosen","year":"2010","unstructured":"A. Rosen and G. Segev. Chosen-ciphertext security via correlated products. SIAM J. Comput., 39(7):3058\u20133088, 2010","journal-title":"SIAM J. Comput."},{"key":"9246_CR39","doi-asserted-by":"crossref","unstructured":"R.\u00a0D. Rothblum. On the circular security of bit-encryption, in A. Sahai, editor, Proceedings of the Theory of Cryptography, The Tenth Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3\u20136, 2013. Lecture Notes in Computer Science, vol. 7785 (Springer, 2013), pp. 579\u2013598","DOI":"10.1007\/978-3-642-36594-2_32"},{"key":"9246_CR40","doi-asserted-by":"crossref","unstructured":"Y. Vahlis. Two is a crowd? a black-box separation of one-wayness and security under correlated inputs. In Micciancio [31], pp. 165\u2013182","DOI":"10.1007\/978-3-642-11799-2_11"},{"key":"9246_CR41","doi-asserted-by":"crossref","unstructured":"D. Wagner, editor. Proceedings of the Advances in Cryptology\u2014CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2008. Lecture Notes in Computer Science, vol. 5157 (Springer, 2008)","DOI":"10.1007\/978-3-540-85174-5"},{"key":"9246_CR42","doi-asserted-by":"crossref","unstructured":"H. Wee. Dual projective hashing and its applicationslossy trapdoor functions and more, in D. Pointcheval and T. Johansson, editors, Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2012, 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15\u201319, 2012. Lecture Notes in Computer Science, vol. 7237 (Springer, 2012), pp. 246\u2013262","DOI":"10.1007\/978-3-642-29011-4_16"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-016-9246-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-016-9246-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-016-9246-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:46:47Z","timestamp":1749768407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-016-9246-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,29]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9246"],"URL":"https:\/\/doi.org\/10.1007\/s00145-016-9246-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2016,11,29]]},"assertion":[{"value":"30 June 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}