{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T21:00:00Z","timestamp":1763499600993,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-19-1-2294"],"award-info":[{"award-number":["N00014-19-1-2294"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Packard Foundation"},{"name":"UT Austin Provost Fellowship"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1908611, CNS-1908181"],"award-info":[{"award-number":["CNS-1908611, CNS-1908181"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484562","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"2738-2757","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["PPE Circuits for Rational Polynomials"],"prefix":"10.1145","author":[{"given":"Susan","family":"Hohenberger","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Satyanarayana","family":"Vusirikala","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Masayuki Abe Melissa Chase Bernardo David Markulf Kohlweiss Ryo Nishimaki and Miyako Ohkubo. 2012a. Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. Cryptology ePrint Archive Report 2012\/285. https:\/\/eprint.iacr.org\/2012\/285 ."},{"key":"e_1_3_2_1_2_1","unstructured":"Masayuki Abe Melissa Chase Bernardo David Markulf Kohlweiss Ryo Nishimaki and Miyako Ohkubo. 2012b. Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. In ASIACRYPT."},{"volume-title":"Advances in Cryptology -","author":"Abe Masayuki","key":"e_1_3_2_1_3_1","unstructured":"Masayuki Abe, Jens Groth, Miyako Ohkubo, and Takeya Tango. 2014a. Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups. In Advances in Cryptology - CRYPTO. Springer, 241--260."},{"key":"e_1_3_2_1_4_1","first-page":"390","article-title":"Structure-Preserving Signatures from Type II Pairings","volume":"2014","author":"Abe Masayuki","year":"2014","unstructured":"Masayuki Abe, Jens Groth, Miyako Ohkubo, and Mehdi Tibouchi. 2014b. Structure-Preserving Signatures from Type II Pairings. In Advances in Cryptology - CRYPTO 2014. 390--407.","journal-title":"Advances in Cryptology - CRYPTO"},{"volume-title":"Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming. In Advances in Cryptology -","author":"Abe Masayuki","key":"e_1_3_2_1_5_1","unstructured":"Masayuki Abe, Fumitaka Hoshino, and Miyako Ohkubo. 2016. Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming. In Advances in Cryptology - CRYPTO. Springer, 387--415."},{"key":"e_1_3_2_1_6_1","volume-title":"Certified Synthesis of Efficient Batch Verifiers. In IEEE 27th Computer Security Foundations Symposium. IEEE Computer Society, 153--165","author":"Akinyele Joseph A.","year":"2014","unstructured":"Joseph A. Akinyele, Gilles Barthe, Benjamin Gr\u00e9 goire, Benedikt Schmidt, and Pierre-Yves Strub. 2014a. Certified Synthesis of Efficient Batch Verifiers. In IEEE 27th Computer Security Foundations Symposium. IEEE Computer Society, 153--165."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813601"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516718"},{"volume-title":"the ACM Conference on Computer and Communications Security. ACM, 474--487","author":"Akinyele Joseph A.","key":"e_1_3_2_1_9_1","unstructured":"Joseph A. Akinyele, Matthew Green, Susan Hohenberger, and Matthew W. Pagano. 2012. Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes. In the ACM Conference on Computer and Communications Security. ACM, 474--487."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2699777.2699778"},{"key":"e_1_3_2_1_11_1","volume-title":"Benjamin Gr\u00e9 goire","author":"Almeida Jos\u00e9 Bacelar","year":"2019","unstructured":"Jos\u00e9 Bacelar Almeida, Manuel Barbosa, Gilles Barthe, Matthew Campagna, Ernie Cohen, Benjamin Gr\u00e9 goire, Vitor Pereira, Bernardo Portela, Pierre-Yves Strub, and Serdar Tasiran. 2019 a. A Machine-Checked Proof of Security for AWS Key Management Service. In CCS. 63--78."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Bacelar Almeida Cecile Baritel-Ruet Manuel Barbosa Gilles Barthe Francois Dupressoir Benjamin Gr\u00e9 goire Vincent Laporte Tiago Oliveira Alley Stoughton and Pierre-Yves Strub. 2019 b. Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3. In CCS. 1607--1622.","DOI":"10.1145\/3319535.3363211"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134088"},{"volume-title":"Advances in Cryptology -","author":"Ambrona Miguel","key":"e_1_3_2_1_15_1","unstructured":"Miguel Ambrona, Gilles Barthe, and Benedikt Schmidt. 2016. Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. In Advances in Cryptology - EUROCRYPT. Springer, 822--851."},{"key":"e_1_3_2_1_16_1","unstructured":"Manuel Barbosa Gilles Barthe Karthik Bhargavan Bruno Blanchet Cas Cremers Kevin Liao and Bryan Parno. 2019. SoK: Computer-Aided Cryptography. Cryptology ePrint Archive Report 2019\/1393. https:\/\/eprint.iacr.org\/2019\/1393 ."},{"key":"e_1_3_2_1_17_1","volume-title":"Yassine Lakhnech, and Benedikt Schmidt.","author":"Barthe Gilles","year":"2015","unstructured":"Gilles Barthe, Juan Manuel Crespo, Yassine Lakhnech, and Benedikt Schmidt. 2015a. Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols. In Advances in Cryptology - EUROCRYPT. Springer, 689--718."},{"key":"e_1_3_2_1_18_1","unstructured":"Gilles Barthe Francois Dupressoir Benjamin Gregoire Alley Stoughton and Pierre-Yves Strub. 2018a. EasyCrypt: Computer-Aided Cryptographic Proofs. https:\/\/www.easycrypt.info\/trac\/."},{"volume-title":"Advances in Cryptology -","author":"Barthe Gilles","key":"e_1_3_2_1_19_1","unstructured":"Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, and Benedikt Schmidt. 2014. Automated Analysis of Cryptographic Assumptions in Generic Group Models. In Advances in Cryptology - CRYPTO. Springer, 95--112."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Gilles Barthe Edvard Fagerholm Dario Fiore Andre Scedrov Benedikt Schmidt and Mehdi Tibouchi. 2015b. Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. In Public-Key Cryptography - PKC. 355--376.","DOI":"10.1007\/978-3-662-46447-2_16"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243825"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480894"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813697"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.1"},{"volume-title":"Advances in Cryptology -","author":"Boneh Dan","key":"e_1_3_2_1_25_1","unstructured":"Dan Boneh and Xavier Boyen. 2004 a. Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In Advances in Cryptology - EUROCRYPT. Springer, 223--238."},{"volume-title":"2004 b. Secure Identity Based Encryption Without Random Oracles","author":"Boneh Dan","key":"e_1_3_2_1_26_1","unstructured":"Dan Boneh and Xavier Boyen. 2004 b. Secure Identity Based Encryption Without Random Oracles. In CRYPTO. Springer, 443--459."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Xavier Boyen. 2004 c. Short Signatures Without Random Oracles. In EUROCRYPT.","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_3_2_1_28_1","first-page":"440","article-title":"Hierarchical Identity Based Encryption with Constant Size Ciphertext","volume":"2005","author":"Boneh Dan","year":"2005","unstructured":"Dan Boneh, Xavier Boyen, and Eu-Jin Goh. 2005. Hierarchical Identity Based Encryption with Constant Size Ciphertext. In Advances in Cryptology - EUROCRYPT 2005. 440--456.","journal-title":"Advances in Cryptology - EUROCRYPT"},{"key":"e_1_3_2_1_29_1","volume-title":"Franklin","author":"Boneh Dan","year":"2001","unstructured":"Dan Boneh and Matthew K. Franklin. 2001. Identity-Based Encryption from the Weil Pairing. In Advances in Cryptology - CRYPTO. Springer, 213--229."},{"volume-title":"Short Signatures from the Weil Pairing","author":"Boneh Dan","key":"e_1_3_2_1_30_1","unstructured":"Dan Boneh, Ben Lynn, and Hovav Shacham. 2001. Short Signatures from the Weil Pairing. In ASIACRYPT. Springer, 514--532."},{"volume-title":"Advances in Cryptology -","author":"Boyen Xavier","key":"e_1_3_2_1_31_1","unstructured":"Xavier Boyen and Brent Waters. 2006 a. Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In Advances in Cryptology - CRYPTO. Springer, 290--307."},{"key":"e_1_3_2_1_32_1","first-page":"427","article-title":"b","volume":"2006","author":"Boyen Xavier","year":"2006","unstructured":"Xavier Boyen and Brent Waters. 2006 b. Compact Group Signatures Without Random Oracles. In Advances in Cryptology - EUROCRYPT 2006. 427--444.","journal-title":"Compact Group Signatures Without Random Oracles. In Advances in Cryptology - EUROCRYPT"},{"volume-title":"Advances in Cryptology -","author":"Camenisch Jan","key":"e_1_3_2_1_33_1","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2004. Signature Schemes and Anonymous Credentials from Bilinear Maps. In Advances in Cryptology - CRYPTO. Springer, 56--72."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2019.00019"},{"volume-title":"Efficient Construction of (Distributed) Verifiable Random Functions","author":"Dodis Yevgeniy","key":"e_1_3_2_1_35_1","unstructured":"Yevgeniy Dodis. 2003. Efficient Construction of (Distributed) Verifiable Random Functions. In Public Key Cryptography - PKC. Springer, 1--17."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30580-4_28"},{"volume-title":"2006 a. Practical Identity-Based Encryption Without Random Oracles","author":"Gentry Craig","key":"e_1_3_2_1_37_1","unstructured":"Craig Gentry. 2006 a. Practical Identity-Based Encryption Without Random Oracles. In EUROCRYPT. Springer."},{"volume-title":"Advances in Cryptology -","author":"Gentry Craig","key":"e_1_3_2_1_38_1","unstructured":"Craig Gentry. 2006 b. Practical Identity-Based Encryption Without Random Oracles. In Advances in Cryptology - EUROCRYPT. Springer, 445--464."},{"volume-title":"Advances in Cryptology -","author":"Gentry Craig","key":"e_1_3_2_1_39_1","unstructured":"Craig Gentry and Alice Silverberg. 2002. Hierarchical ID-Based Cryptography. In Advances in Cryptology - ASIACRYPT. Springer, 548--566."},{"volume-title":"Advances in Cryptology -","author":"Goyal Vipul","key":"e_1_3_2_1_40_1","unstructured":"Vipul Goyal. 2007. Reducing Trust in the PKG in Identity Based Cryptosystems. In Advances in Cryptology - CRYPTO. Springer, 430--447."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455824"},{"volume-title":"Advances in Cryptology -","author":"Green Matthew","key":"e_1_3_2_1_42_1","unstructured":"Matthew Green and Susan Hohenberger. 2007. Blind Identity-Based Encryption and Simulatable Oblivious Transfer. In Advances in Cryptology - ASIACRYPT. Springer, 265--282."},{"volume-title":"Efficient non-interactive proof systems for bilinear groups","author":"Groth Jens","key":"e_1_3_2_1_43_1","unstructured":"Jens Groth and Amit Sahai. 2008. Efficient non-interactive proof systems for bilinear groups. In EUROCRYPT. Springer, 415--432."},{"key":"e_1_3_2_1_44_1","volume-title":"Computer-Aided Proofs for Multiparty Computation with Active Security. In IEEE Computer Security Foundations Symposium, CSF","author":"Haagh Helene","year":"2018","unstructured":"Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, and Pierre-Yves Strub. 2018. Computer-Aided Proofs for Multiparty Computation with Active Security. In IEEE Computer Security Foundations Symposium, CSF 2018."},{"volume-title":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, 84--95","author":"Hoang Viet Tung","key":"e_1_3_2_1_45_1","unstructured":"Viet Tung Hoang, Jonathan Katz, and Alex J. Malozemoff. 2015. Automated Analysis and Synthesis of Authenticated Encryption Schemes. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, 84--95."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339808"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417230"},{"volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference","author":"Jager Tibor","key":"e_1_3_2_1_48_1","unstructured":"Tibor Jager. 2015. Verifiable Random Functions from Weaker Assumptions. In Theory of Cryptography - 12th Theory of Cryptography Conference, TCC. Springer, 121--143."},{"key":"e_1_3_2_1_49_1","volume-title":"Conference on security in network architecture and information systems.","author":"Le Duc-Phong","year":"2007","unstructured":"Duc-Phong Le and Alban Gabillon. 2007. A New Multisignature Scheme based on Strong Diffie-Hellman Assumption. In Conference on security in network architecture and information systems."},{"volume-title":"Advances in Cryptology -","author":"Lysyanskaya Anna","key":"e_1_3_2_1_50_1","unstructured":"Anna Lysyanskaya. 2002. Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. In Advances in Cryptology - CRYPTO. Springer, 597--612."},{"volume-title":"Automated Analysis and Synthesis of Block-Cipher Modes of Operation. In IEEE 27th Computer Security Foundations Symposium. IEEE Computer Society, 140--152","author":"Malozemoff Alex J.","key":"e_1_3_2_1_51_1","unstructured":"Alex J. Malozemoff, Jonathan Katz, and Matthew D. Green. 2014. Automated Analysis and Synthesis of Block-Cipher Modes of Operation. In IEEE 27th Computer Security Foundations Symposium. IEEE Computer Society, 140--152."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-65127-9_22"},{"key":"e_1_3_2_1_53_1","volume-title":"Secure and Practical Identity-Based Encryption. IACR Cryptology ePrint Archive","author":"Naccache David","year":"2005","unstructured":"David Naccache. 2005. Secure and Practical Identity-Based Encryption. IACR Cryptology ePrint Archive (2005). http:\/\/eprint.iacr.org\/2005\/369"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516672"},{"key":"e_1_3_2_1_55_1","first-page":"51","article-title":"Semantic Security Invariance under Variant Computational Assumptions","volume":"2018","author":"Theodorakis Eftychios","year":"2018","unstructured":"Eftychios Theodorakis and John C. Mitchell. 2018. Semantic Security Invariance under Variant Computational Assumptions. IACR Cryptol. ePrint Arch., Vol. 2018 (2018), 51. http:\/\/eprint.iacr.org\/2018\/051","journal-title":"IACR Cryptol. ePrint Arch."},{"volume-title":"Efficient Identity-Based Encryption Without Random Oracles","author":"Waters Brent","key":"e_1_3_2_1_56_1","unstructured":"Brent Waters. 2005. Efficient Identity-Based Encryption Without Random Oracles. In EUROCRYPT. Springer, 114--127."},{"volume-title":"Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions","author":"Waters Brent","key":"e_1_3_2_1_57_1","unstructured":"Brent Waters. 2009. Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions. In CRYPTO. Springer, 619--636."}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484562","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484562","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:54:20Z","timestamp":1763499260000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":57,"alternative-id":["10.1145\/3460120.3484562","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484562","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}