{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:18Z","timestamp":1750306578109,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1330308","CNS-1253870","CNS-1228620","CNS-1065134","CNS-1064944","CNS-1319061","CNS-0845610","CNS-1228782"],"award-info":[{"award-number":["CNS-1330308","CNS-1253870","CNS-1228620","CNS-1065134","CNS-1064944","CNS-1319061","CNS-0845610","CNS-1228782"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,3]]},"DOI":"10.1145\/2660267.2660351","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T13:40:05Z","timestamp":1415713205000},"page":"1292-1303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Formatted Encryption Beyond Regular Languages"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Luchaup","sequence":"first","affiliation":[{"name":"University of Wisconsin at Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Shrimpton","sequence":"additional","affiliation":[{"name":"Portland State University, Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Ristenpart","sequence":"additional","affiliation":[{"name":"University of Wisconsin at Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somesh","family":"Jha","sequence":"additional","affiliation":[{"name":"University of Wisconsin at Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The gnu multiple precision arithmetic library.http:\/\/gmplib.org\/.  The gnu multiple precision arithmetic library.http:\/\/gmplib.org\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_19"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646140.680945"},{"key":"e_1_3_2_1_4_1","first-page":"141","volume-title":"20th National Information Systems Security Conference Proceedings (NISSC)","author":"Brightwell M.","year":"1997","unstructured":"M. Brightwell and H. Smith . Using datatype-preserving encryption to enhance data warehouse security . In 20th National Information Systems Security Conference Proceedings (NISSC) , pages 141 -- 149 , 1997 . M. Brightwell and H. Smith. Using datatype-preserving encryption to enhance data warehouse security. In 20th National Information Systems Security Conference Proceedings (NISSC), pages 141--149, 1997."},{"key":"e_1_3_2_1_5_1","unstructured":"Ansi c99 grammar yacc specification. http:\/\/www.quut.com\/c\/ANSI-C-grammar-y-1999.html.  Ansi c99 grammar yacc specification. http:\/\/www.quut.com\/c\/ANSI-C-grammar-y-1999.html."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516657"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22194"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881552.1881553"},{"key":"e_1_3_2_1_10_1","volume-title":"USA","author":"Ibarra O. H.","year":"1985","unstructured":"O. H. Ibarra and B. Ravikumar . On sparseness, ambiguity and other decision problems for acceptors and transducers. In 3rd annual symposium on theoretical aspects of computer science on STACS 86, pages 171--179, New York, NY , USA , 1985 . Springer-Verlag New York, Inc. O. H. Ibarra and B. Ravikumar. On sparseness, ambiguity and other decision problems for acceptors and transducers. In 3rd annual symposium on theoretical aspects of computer science on STACS 86, pages 171--179, New York, NY, USA, 1985. Springer-Verlag New York, Inc."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/313651.313803"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505242"},{"key":"e_1_3_2_1_13_1","volume-title":"Lex & Yacc, 2Nd Edition. O'Reilly","author":"Levine J.","year":"1992","unstructured":"J. Levine , T. Mason , and D. Brown . Lex & Yacc, 2Nd Edition. O'Reilly , second edition, 1992 . J. Levine, T. Mason, and D. Brown. Lex & Yacc, 2Nd Edition. O'Reilly, second edition, 1992."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 14th conference on USENIX Security Symposium","author":"Luchaup D.","year":"2014","unstructured":"D. Luchaup , K. P. Dyer , S. Jha , T. Ristenpart , and T. Shrimpton . Libfte: A user-friendly toolkit for constructing practical format-abiding encryption schemes . In Proceedings of the 14th conference on USENIX Security Symposium , 2014 . D. Luchaup, K. P. Dyer, S. Jha, T. Ristenpart, and T. Shrimpton. Libfte: A user-friendly toolkit for constructing practical format-abiding encryption schemes. In Proceedings of the 14th conference on USENIX Security Symposium, 2014."},{"key":"e_1_3_2_1_15_1","volume-title":"ISO\/IEC JTC1\/SC29\/WGll\/N2467","author":"M\u00e4kinen E.","year":"1997","unstructured":"E. M\u00e4kinen . Ranking and unranking left szilard languages. Technical report , ISO\/IEC JTC1\/SC29\/WGll\/N2467 , Atlantic City , 1997 . E. M\u00e4kinen. Ranking and unranking left szilard languages. Technical report, ISO\/IEC JTC1\/SC29\/WGll\/N2467, Atlantic City, 1997."},{"key":"e_1_3_2_1_16_1","volume-title":"Combinatorial Algorithms. New York : Academic Press","author":"Nijenhuis A.","year":"1975","unstructured":"A. Nijenhuis and H. S. Wilf . Combinatorial Algorithms. New York : Academic Press , 1975 . A. Nijenhuis and H. S. Wilf. Combinatorial Algorithms. New York : Academic Press, 1975."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218083"},{"key":"e_1_3_2_1_18_1","volume-title":"The hasty pudding cipher. AES candidate submitted to NIST, page M1","author":"Schroeppel R.","year":"1998","unstructured":"R. Schroeppel and H. Orman . The hasty pudding cipher. AES candidate submitted to NIST, page M1 , 1998 . R. Schroeppel and H. Orman. The hasty pudding cipher. AES candidate submitted to NIST, page M1, 1998."},{"key":"e_1_3_2_1_19_1","volume-title":"Cengage Learning","author":"Sipser M.","year":"2012","unstructured":"M. Sipser . Introduction to the Theory of Computation . Cengage Learning , 2012 . M. Sipser. Introduction to the Theory of Computation. Cengage Learning, 2012."}],"event":{"name":"CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Scottsdale Arizona USA","acronym":"CCS'14"},"container-title":["Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660351","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660267.2660351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:39Z","timestamp":1750227219000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":19,"alternative-id":["10.1145\/2660267.2660351","10.1145\/2660267"],"URL":"https:\/\/doi.org\/10.1145\/2660267.2660351","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}