{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:12:29Z","timestamp":1747807949575},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642286407"},{"type":"electronic","value":"9783642286414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28641-4_12","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T17:10:46Z","timestamp":1332436246000},"page":"209-228","source":"Crossref","is-referenced-by-count":9,"title":["Verified Indifferentiable Hashing into Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Barthe","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Gr\u00e9goire","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Heraud","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Olmedo","sequence":"additional","affiliation":[]},{"given":"Santiago","family":"Zanella B\u00e9guelin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-15497-3_10","volume-title":"Computer Security \u2013 ESORICS 2010","author":"J.B. Almeida","year":"2010","unstructured":"Almeida, J.B., Bangerter, E., Barbosa, M., Krenn, S., Sadeghi, A.-R., Schneider, T.: A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on \u03a3-Protocols. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 151\u2013167. Springer, Heidelberg (2010)"},{"issue":"8","key":"12_CR2","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.scico.2007.09.002","volume":"74","author":"P. Audebaud","year":"2009","unstructured":"Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Sci. Comput. Program.\u00a074(8), 568\u2013589 (2009)","journal-title":"Sci. Comput. Program."},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G. Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., Zanella B\u00e9guelin, S.: Computer-Aided Security Proofs for the Working Cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 71\u201390. Springer, Heidelberg (2011)"},{"key":"12_CR4","first-page":"90","volume-title":"36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009","author":"G. Barthe","year":"2009","unstructured":"Barthe, G., Gr\u00e9goire, B., Zanella B\u00e9guelin, S.: Formal certification of code-based cryptographic proofs. In: 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, pp. 90\u2013101. ACM, New York (2009)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/CSF.2010.24","volume-title":"23rd IEEE Computer Security Foundations Symposium, CSF 2010","author":"G. Barthe","year":"2010","unstructured":"Barthe, G., Hedin, D., Zanella B\u00e9guelin, S., Gr\u00e9goire, B., Heraud, S.: A machine-checked formalization of Sigma-protocols. In: 23rd IEEE Computer Security Foundations Symposium, CSF 2010, pp. 246\u2013260. IEEE Computer Society, Los Alamitos (2010)"},{"doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., Zanella B\u00e9guelin, S.: Probabilistic reasoning for differential privacy. In: 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012. ACM (2012)","key":"12_CR6","DOI":"10.1145\/2103656.2103670"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/RISP.1992.213269","volume-title":"13th IEEE Symposium on Security and Privacy, S&P 1992","author":"S. Bellovin","year":"1992","unstructured":"Bellovin, S., Merritt, M.: Encrypted key exchange: password-based protocols secure against dictionary attacks. In: 13th IEEE Symposium on Security and Privacy, S&P 1992, pp. 72\u201384. IEEE Computer Society, Los Alamitos (1992)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. Journal of Cryptology\u00a017, 297\u2013319 (2004)","journal-title":"Journal of Cryptology"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-642-14623-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"E. Brier","year":"2010","unstructured":"Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 237\u2013254. Springer, Heidelberg (2010)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"issue":"3","key":"12_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/JCS-2007-15302","volume":"15","author":"D. Clark","year":"2007","unstructured":"Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security\u00a015(3), 321\u2013371 (2007)","journal-title":"Journal of Computer Security"},{"issue":"6","key":"12_CR12","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"M.R. Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. Journal of Computer Security\u00a018(6), 1157\u20131210 (2010)","journal-title":"Journal of Computer Security"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.-S. Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd Revisited: How to Construct a Hash Function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential Privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Farashahi, R.R., Fouque, P.A., Shparlinski, I., Tibouchi, M., Voloch, J.F.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Mathematics of Computation (2011)","key":"12_CR15","DOI":"10.1090\/S0025-5718-2012-02606-8"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-14081-5_8","volume-title":"Information Security and Privacy","author":"E. Fleischmann","year":"2010","unstructured":"Fleischmann, E., Gorski, M., Lucks, S.: Some Observations on Indifferentiability. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol.\u00a06168, pp. 117\u2013134. Springer, Heidelberg (2010)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-17455-1_17","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"P.-A. Fouque","year":"2010","unstructured":"Fouque, P.-A., Tibouchi, M.: Deterministic Encoding and Hashing to Odd Hyperelliptic Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 265\u2013277. Springer, Heidelberg (2010)"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-74591-4_8","volume-title":"Theorem Proving in Higher Order Logics","author":"G. Gonthier","year":"2007","unstructured":"Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Th\u00e9ry, L.: A Modular Formalisation of Finite Group Theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 86\u2013101. Springer, Heidelberg (2007)"},{"unstructured":"Hurd, J., Gordon, M., Fox, A.: Formalized elliptic curve cryptography. In: High Confidence Software and Systems, HCSS 2006 (2006)","key":"12_CR20"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-03356-8_18","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"T. Icart","year":"2009","unstructured":"Icart, T.: How to Hash into Elliptic Curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 303\u2013316. Springer, Heidelberg (2009)"},{"unstructured":"Icart, T.: Algorithms Mapping into Elliptic Curves and Applications. Ph.D. thesis, Universit\u00e9 du Luxembourg (2010)","key":"12_CR22"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U.M. Maurer","year":"2004","unstructured":"Maurer, U.M., Renner, R.S., Holenstein, C.: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"issue":"1","key":"12_CR24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.3233\/JCS-2004-12103","volume":"12","author":"A.D. Pierro","year":"2004","unstructured":"Pierro, A.D., Hankin, C., Wiklicky, H.: Approximate non-interference. Journal of Computer Security\u00a012(1), 37\u201382 (2004)","journal-title":"Journal of Computer Security"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-20465-4_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"T. Ristenpart","year":"2011","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with Composition: Limitations of the Indifferentiability Framework. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 487\u2013506. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Segala, R., Turrini, A.: Approximated computationally bounded simulation relations for probabilistic automata. In: 20th IEEE Computer Security Foundations Symposium, CSF 2007, pp. 140\u2013156 (2007)","key":"12_CR26","DOI":"10.1109\/CSF.2007.8"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/11792086_36","volume-title":"Algorithmic Number Theory","author":"A. Shallue","year":"2006","unstructured":"Shallue, A., van de Woestijne, C.E.: Construction of Rational Points on Elliptic Curves over Finite Fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 510\u2013524. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press (2009)","key":"12_CR28","DOI":"10.1017\/CBO9780511814549"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-00596-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"G. Smith","year":"2009","unstructured":"Smith, G.: On the Foundations of Quantitative Information Flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 288\u2013302. Springer, Heidelberg (2009)"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-74591-4_24","volume-title":"Theorem Proving in Higher Order Logics","author":"L. Th\u00e9ry","year":"2007","unstructured":"Th\u00e9ry, L., Hanrot, G.: Primality Proving with Elliptic Curves. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 319\u2013333. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28641-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:03:44Z","timestamp":1620111824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28641-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642286407","9783642286414"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28641-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}