{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:27:03Z","timestamp":1780352823377,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T00:00:00Z","timestamp":1410134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,9,8]]},"DOI":"10.1145\/2643135.2643154","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T14:04:29Z","timestamp":1436191469000},"page":"123-133","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Theories of Homomorphic Encryption, Unification, and the Finite Variant Property"],"prefix":"10.1145","author":[{"given":"Fan","family":"Yang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Santiago","family":"Escobar","sequence":"additional","affiliation":[{"name":"DSIC-ELP, Universitat Polit\u00e8cnica de Val\u00e8ncia, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Catherine","family":"Meadows","sequence":"additional","affiliation":[{"name":"Naval Research Laboratory, Washington DC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[{"name":"University at Albany-SUNY, Albany, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,9,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Maude Formal Environment. http:\/\/maude.lcc.uma.es\/MFE\/.  Maude Formal Environment. http:\/\/maude.lcc.uma.es\/MFE\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755713"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_10"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174133"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Franz\n      Baader\n     and \n      Werner\n      Nutt\n    .\n  Adding homomorphisms to commutative\/monoidal theories or how algebra can help in equational unification\n  . In Ronald V. Book editor RTA volume \n  488\n   of \n  Lecture Notes in Computer Science pages \n  124\n  --\n  135\n  . \n  Springer 1991\n  .   Franz Baader and Werner Nutt. Adding homomorphisms to commutative\/monoidal theories or how algebra can help in equational unification. In Ronald V. Book editor RTA volume 488 of Lecture Notes in Computer Science pages 124--135. Springer 1991.","DOI":"10.1007\/3-540-53904-2_91"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"50","volume-title":"CADE","author":"Baader Franz","year":"1992","unstructured":"Franz Baader and Klaus U. Schulz . Unification in the union of disjoint equational theories: Combining decision procedures . In CADE , volume 607 of LNCS , pages 50 -- 65 . Springer , 1992 . Franz Baader and Klaus U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In CADE, volume 607 of LNCS, pages 50--65. Springer, 1992."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39650-5_15"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/872752.873511"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2007.06.002"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Christopher\n      Bouchard Kimberly A.\n      Gero Christopher\n      Lynch and \n      Paliath\n      Narendran\n    .\n  On forward closure and the finite variant property\n  . In Pascal Fontaine Christophe Ringeissen and Renate A. Schmidt editors FroCos volume \n  8152\n   of \n  Lecture Notes in Computer Science pages \n  327\n  --\n  342\n  . \n  Springer 2013\n  .  Christopher Bouchard Kimberly A. Gero Christopher Lynch and Paliath Narendran. On forward closure and the finite variant property. In Pascal Fontaine Christophe Ringeissen and Renate A. Schmidt editors FroCos volume 8152 of Lecture Notes in Computer Science pages 327--342. Springer 2013.","DOI":"10.1007\/978-3-642-40885-4_23"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11734727_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_13_1","first-page":"199","volume-title":"CRYPTO","author":"Chaum David","year":"1982","unstructured":"David Chaum . Blind signatures for untraceable payments . In CRYPTO , pages 199 -- 203 , 1982 . David Chaum. Blind signatures for untraceable payments. In CRYPTO, pages 199--203, 1982."},{"key":"e_1_3_2_1_14_1","volume-title":"Variants of variants and the finite variant property. Technical report","author":"Cholewa Andrew","year":"2014","unstructured":"Andrew Cholewa , Jose Meseguer , and Santiago Escobar . Variants of variants and the finite variant property. Technical report , University of Illinois at Urbana-Champaign , http:\/\/hdl.handle.net\/2142\/47117, 2014 . Andrew Cholewa, Jose Meseguer, and Santiago Escobar. Variants of variants and the finite variant property. Technical report, University of Illinois at Urbana-Champaign, http:\/\/hdl.handle.net\/2142\/47117, 2014."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_22"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_16"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2003476.2003488"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.035"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03829-7_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.05.015"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2012.01.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Deepak\n      Kapur Paliath\n      Narendran and \n      Lida\n      Wang\n    .\n  An E-unification algorithm for analyzing protocols that use modular exponentiation\n  . In Robert Nieuwenhuis editor RTA volume \n  2706\n   of \n  Lecture Notes in Computer Science pages \n  165\n  --\n  179\n  . \n  Springer 2003\n  .   Deepak Kapur Paliath Narendran and Lida Wang. An E-unification algorithm for analyzing protocols that use modular exponentiation. In Robert Nieuwenhuis editor RTA volume 2706 of Lecture Notes in Computer Science pages 165--179. Springer 2003.","DOI":"10.1007\/3-540-44881-0_13"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-540-32254-2_25","volume-title":"Mechanizing Mathematical Reasoning","author":"Kapur Deepak","year":"2005","unstructured":"Deepak Kapur , Paliath Narendran , and Lida Wang . A unification algorithm for analysis of protocols with blinded signatures . In Dieter Hutter and Werner Stephan, editors, Mechanizing Mathematical Reasoning , volume 2605 of Lecture Notes in Computer Science , pages 433 -- 451 . Springer , 2005 . Deepak Kapur, Paliath Narendran, and Lida Wang. A unification algorithm for analysis of protocols with blinded signatures. In Dieter Hutter and Werner Stephan, editors, Mechanizing Mathematical Reasoning, volume 2605 of Lecture Notes in Computer Science, pages 433--451. Springer, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2009.17"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9188-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_32"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90182-F"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645934.673375"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788822"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Werner\n      Nutt\n    .\n  Unification in monoidal theories\n  . In Mark E. Stickel editor CADE volume \n  449\n   of \n  Lecture Notes in Computer Science pages \n  618\n  --\n  632\n  . \n  Springer 1990\n  .   Werner Nutt. Unification in monoidal theories. In Mark E. Stickel editor CADE volume 449 of Lecture Notes in Computer Science pages 618--632. Springer 1990.","DOI":"10.1007\/3-540-52885-7_118"},{"key":"e_1_3_2_1_36_1","volume-title":"Heideman","author":"Plugfelder H. O.","year":"1990","unstructured":"H. O. Plugfelder . Quasigroups and Loops: Introduction . Heideman , 1990 . H. O. Plugfelder. Quasigroups and Loops: Introduction. Heideman, 1990."},{"key":"e_1_3_2_1_37_1","volume-title":"R. DeMillo","author":"Rivest R.","year":"1978","unstructured":"R. Rivest , L. Adleman , and M. Dertouzos . On data banks and privacy homomorphism . In R. DeMillo , R. Lipton, D. Dobkin, and A. Jones, editors, Foundations of Security Computation. ACM , 1978 . R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphism. In R. DeMillo, R. Lipton, D. Dobkin, and A. Jones, editors, Foundations of Security Computation. ACM, 1978."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2012.25"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(89)80022-7"},{"key":"e_1_3_2_1_41_1","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"TeReSe , editor. Term Rewriting Systems . Cambridge University Press , Cambridge , 2003 . TeReSe, editor. Term Rewriting Systems. Cambridge University Press, Cambridge, 2003."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80026-3"}],"event":{"name":"PPDP '14: 16th International Symposium on Principles and Practice of Declarative Programming","location":"Canterbury United Kingdom","acronym":"PPDP '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2643135.2643154","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2643135.2643154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:01Z","timestamp":1750230061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2643135.2643154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,8]]},"references-count":37,"alternative-id":["10.1145\/2643135.2643154","10.1145\/2643135"],"URL":"https:\/\/doi.org\/10.1145\/2643135.2643154","relation":{},"subject":[],"published":{"date-parts":[[2014,9,8]]},"assertion":[{"value":"2014-09-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}