{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T01:07:56Z","timestamp":1759799276603,"version":"build-2065373602"},"reference-count":83,"publisher":"International Association for Cryptologic Research","issue":"3","license":[{"start":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:00Z","timestamp":1751673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,9,2]]},"abstract":"<jats:p> Servan-Schreiber et al. [IEEE S&amp; P, 2023] presented a new notion called private access control lists (PACL) for function secret sharing (FSS), where the FSS evaluators can ensure that the FSS dealer is authorized to share the given function. Their construction relies on costly non-interactive secret-shared proofs and is not secure in the post-quantum setting. We give a construction of PACL from publicly verifiable secret sharing (PVSS) under the short integer solution (SIS) problem. Our construction adapts the Gentry et al.'s scheme [EUROCRYPT, 2022] for the post-quantum setting based on the learning with error (LWE) assumption aimed at ensuring that database access control policies are enforced by FSS evaluators, who verify that the FSS dealer is authorized to share the specified database query function. The benchmarks of our PACL show a trade-off between proving and verification efficiency, making the optimal choice dependent on application requirements. This construction has many applications for access control by applying FSS. We also present a secure data retrieval scheme using DPF-PACL for access control, which complements the PACL framework while providing independent utility. <\/jats:p>","DOI":"10.62056\/akmpxrdja","type":"journal-article","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T18:49:52Z","timestamp":1759776592000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["Post-Quantum Access Control with Application to Secure Data Retrieval"],"prefix":"10.62056","volume":"2","author":[{"given":"Behzad","family":"Abdolmaleki","sequence":"first","affiliation":[{"name":"University of Sheffield","place":["Sheffield, United Kingdom"]}]},{"given":"Hannes","family":"Bl\u00fcmel","sequence":"additional","affiliation":[{"name":"Barkhausen Institut","place":["Dresden, Germany"]}]},{"given":"Tianxiang","family":"Dai","sequence":"additional","affiliation":[{"name":"Lancaster University Leipzig","place":["Leipzig, Germany"]}]},{"given":"Giacomo","family":"Fenzi","sequence":"additional","affiliation":[{"name":"EPFL","place":["Lausanne, Switzerland"]}]},{"given":"Homa","family":"Khajeh","sequence":"additional","affiliation":[{"name":"Independent researcher","place":["Isfahan, Iran"]}]},{"given":"Stefan","family":"K\u00f6psell","sequence":"additional","affiliation":[{"name":"Barkhausen Institut","place":["Dresden, Germany"]}]},{"given":"Maryam","family":"Zarezadeh","sequence":"additional","affiliation":[{"name":"Barkhausen Institut","place":["Dresden, Germany"]}]}],"member":"48349","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"ref1:deebak2020smart","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/JSAC.2020.3020599","article-title":"Smart mutual authentication protocol for cloud based medical\n  healthcare systems using internet of medical things","volume":"39","author":"Bakkiam David Deebak","year":"2020","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"ref2:shakil2020bamhealthcloud","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jksuci.2017.07.001","article-title":"BAMHealthCloud: A biometric authentication and data\n  management system for healthcare data in cloud","volume":"32","author":"Farhana J Shakil Kashish A and Zareen","year":"2020","journal-title":"Journal of King Saud University-Computer and Information\n  Sciences"},{"key":"ref3:rajeshkumar2024novel","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11042-024-18147-6","article-title":"A novel three-factor authentication and optimal mapreduce\n  frameworks for secure medical big data transmission over the cloud with\n  shaxecc","author":"K Rajeshkumar","year":"2024","journal-title":"Multimedia Tools and Applications"},{"key":"ref4:zhou2011enforcing","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1093\/comjnl\/bxr080","article-title":"Enforcing role-based access control for secure data storage\n  in the cloud","volume":"54","author":"Lan Zhou","year":"2011","journal-title":"The Computer Journal"},{"key":"ref5:tembhare2019role","doi-asserted-by":"publisher","first-page":"5866","DOI":"10.1007\/s11227-019-02887-6","article-title":"Role-based policy to maintain privacy of patient health\n  records in cloud","volume":"75","author":"Akshay Tembhare","year":"2019","journal-title":"The Journal of Supercomputing"},{"key":"ref6:rashid2020securing","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-030-37468-6_25","article-title":"Securing E-Health IoT data on cloud systems using novel\n  extended role based access control model","author":"Mamoon Rashid","year":"2020","journal-title":"Internet of Things (IoT) Concepts and Applications"},{"key":"ref7:jayasankar2021securing","first-page":"1075","article-title":"Securing Medical Data using Extended Role Based Access\n  Control Model and Two fish Algorithms on Cloud Platform.","volume":"8","author":"T Jayasankar","year":"2021","journal-title":"European Journal of Molecular and Clinical Medicine"},{"key":"ref8:wang2010privacy","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/INFCOM.2010.5462173","article-title":"Privacy-preserving public auditing for data storage security\n  in cloud computing","author":"Cong Wang","year":"2010"},{"key":"ref9:li2017public","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.3390\/s17051032","article-title":"Public auditing with privacy protection in a multi-user\n  model of cloud-assisted body sensor networks","volume":"17","author":"Song Li","year":"2017","journal-title":"Sensors"},{"key":"ref10:boyle2015function","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","article-title":"Function secret sharing","author":"Elette Boyle","year":"2015"},{"key":"ref11:wang2017splinter","first-page":"299","article-title":"Splinter: Practical private queries on public data","author":"Frank Wang","year":"2017"},{"key":"ref12:dauterman2022waldo","doi-asserted-by":"publisher","first-page":"2450","DOI":"10.1109\/SP46214.2022.9833611","article-title":"Waldo: A private time-series database from function secret\n  sharing","author":"Emma Dauterman","year":"2022"},{"key":"ref13:ryffel2020ariann","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0015","article-title":"Ariann: Low-interaction privacy-preserving deep learning via\n  function secret sharing","author":"Th\u00e9o Ryffel","year":"2020","journal-title":"arXiv preprint arXiv:2006.04593"},{"key":"ref14:liu2023online","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1145\/3583780.3614998","article-title":"Online Efficient Secure Logistic Regression based on\n  Function Secret Sharing","author":"Jing Liu","year":"2023"},{"key":"ref15:jiang2024sigbdt","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/3634737.3657024","article-title":"SiGBDT: Large-Scale Gradient Boosting Decision Tree Training\n  via Function Secret Sharing","author":"Yufan Jiang","year":"2024"},{"key":"ref16:fu2024fss","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3446233","article-title":"FSS-DBSCAN: Outsourced Private Density-Based Clustering via\n  Function Secret Sharing","author":"Jiaxuan Fu","year":"2024","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"ref17:li2024nemo","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3351433","article-title":"NEMO: Practical Distributed Boolean Queries With Minimal\n  Leakage","author":"Jianhao Li","year":"2024","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"ref18:dittmer2022streaming","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-031-14791-3_25","article-title":"Streaming and unbalanced psi from function secret sharing","author":"Samuel Dittmer","year":"2022"},{"key":"ref19:sun2024efficient","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1117\/12.3031902","article-title":"Efficient multiparty private set intersection protocol based\n  on function secret sharing","volume":"13175","author":"Zhen Sun","year":"2024"},{"key":"ref20:chen2020etoram","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/OJCS.2020.3032020","article-title":"Etoram: A more efficient ORAM for secure computation","volume":"1","author":"Zhihong Chen","year":"2020","journal-title":"IEEE Open Journal of the Computer Society"},{"key":"ref21:bunn2020efficient","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-57990-6_11","article-title":"Efficient 3-party distributed ORAM","author":"Paul Bunn","year":"2020"},{"key":"ref22:garimella2022structure","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-031-15802-5_12","article-title":"Structure-aware private set intersection, with applications\n  to fuzzy matching","author":"Gayathri Garimella","year":"2022"},{"key":"ref23:zang2024hiddentor","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/ICDCS60910.2024.00119","article-title":"HiddenTor: Toward a User-Centric and Private Query System\n  for Tor BridgeDB","author":"Yichen Zang","year":"2024"},{"key":"ref24:servan2023private","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1109\/SP46215.2023.10179295","article-title":"Private access control for function secret sharing","author":"Sacha Servan-Schreiber","year":"2023"},{"key":"ref25:gentry2022practical","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-031-06944-4_16","article-title":"Practical non-interactive publicly verifiable secret sharing\n  with thousands of parties","author":"Craig Gentry","year":"2022"},{"key":"ref26:bruestle2023risc","article-title":"RISC Zero ZKVM: Scalable, Transparent Arguments of RISC-V\n  Integrity","volume":"29","author":"Jeremy Bruestle","year":"2023","journal-title":"Draft. July"},{"key":"ref27:gilboa2014distributed","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","article-title":"Distributed point functions and their applications","author":"Niv Gilboa","year":"2014"},{"key":"ref28:choi2013multi","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-36594-2_28","article-title":"Multi-client non-interactive verifiable computation","author":"Seung Geol Choi","year":"2013"},{"key":"ref29:tan2017access","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/3055504.3055509","article-title":"Access control encryption based on LWE","author":"Gaosheng Tan","year":"2017"},{"key":"ref30:kim2017access","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-319-70694-8_17","article-title":"Access control encryption for general policies from standard\n  assumptions","author":"Sam Kim","year":"2017"},{"key":"ref31:wang2021access","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-78372-3_16","article-title":"Access control encryption from group encryption","author":"Xiuhua Wang","year":"2021"},{"key":"ref32:applebaum2019secret","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-17659-4_15","article-title":"Secret-sharing schemes for general and uniform access\n  structures","author":"Benny Applebaum","year":"2019"},{"key":"ref33:beimel2021linear","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1109\/TIT.2021.3132917","article-title":"Linear secret-sharing schemes for forbidden graph access\n  structures","volume":"68","author":"Amos Beimel","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref34:sehrawat2021extremal","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2021.07.022","article-title":"Extremal set theory and LWE based access structure hiding\n  verifiable secret sharing with malicious-majority and free verification","volume":"886","author":"Vipin Singh Sehrawat","year":"2021","journal-title":"Theoretical Computer Science"},{"key":"ref35:vadapalli2022sabre","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1109\/SP46214.2022.9833601","article-title":"Sabre: Sender-anonymous messaging with fast audits","author":"Adithya Vadapalli","year":"2022"},{"key":"ref36:ji2023fine","article-title":"Fine-grained Policy Constraints for Distributed Point\n  Function","author":"Keyu Ji","year":"2023","journal-title":"Cryptology ePrint Archive"},{"key":"ref37:abdalla2020inner","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-64840-4_16","article-title":"Inner-product functional encryption with fine-grained access\n  control","author":"Michel Abdalla","year":"2020"},{"key":"ref38:dowerah2024sacfe","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/EuroSP60621.2024.00053","article-title":"SACfe: Secure Access Control in Functional Encryption with\n  Unbounded Data","author":"Uddipana Dowerah","year":"2024"},{"key":"ref39:nguyen2025multi","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-031-91826-1_3","article-title":"Multi-client functional encryption with public inputs and\n  strong security","author":"Ky Nguyen","year":"2025"},{"key":"ref40:camenisch2009oblivious","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1653662.1653679","article-title":"Oblivious transfer with access control","author":"Jan Camenisch","year":"2009"},{"key":"ref41:camenisch2011oblivious","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-19379-8_12","article-title":"Oblivious transfer with hidden access control policies","author":"Jan Camenisch","year":"2011"},{"key":"ref42:abe2013universally","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2517881.2517883","article-title":"Universally composable adaptive oblivious transfer (with\n  access control) from standard assumptions","author":"Masayuki Abe","year":"2013"},{"key":"ref43:libert2017adaptive","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-319-70694-8_19","article-title":"Adaptive oblivious transfer with access control from lattice\n  assumptions","author":"Beno\u00eet Libert","year":"2017"},{"key":"ref44:damodaran2020unlinkable","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-55304-3_30","article-title":"Unlinkable updatable databases and oblivious transfer with\n  access control","author":"Aditya Damodaran","year":"2020"},{"key":"ref45:cai2024using","doi-asserted-by":"publisher","first-page":"103759","DOI":"10.1016\/j.jisa.2024.103759","article-title":"Using private set intersection to achieve privacy-preserving\n  authorization for IoT systems","volume":"83","author":"Rongsheng Cai","year":"2024","journal-title":"Journal of Information Security and Applications"},{"key":"ref46:malina2018secure","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.cose.2018.05.006","article-title":"Secure and efficient two-factor zero-knowledge\n  authentication solution for access control systems","volume":"77","author":"Lukas Malina","year":"2018","journal-title":"Computers & Security"},{"key":"ref47:xu2018query","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/3183713.3183741","article-title":"When query authentication meets fine-grained access control:\n  A zero-knowledge approach","author":"Cheng Xu","year":"2018"},{"key":"ref48:liu2021non","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-030-95388-1_41","article-title":"Non-interactive Zero Knowledge Proof Based Access Control in\n  Information-Centric Internet of Things","author":"Han Liu","year":"2021"},{"key":"ref49:lalouani2024lightweight","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SmartNets61466.2024.10577736","article-title":"Lightweight Zero Knowledge Proof-Based Multi Access Control\n  Schema for Smart Telehealth System","author":"Wassila Lalouani","year":"2024"},{"key":"ref50:luo2009anonymous","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1109\/ICME.2009.5202677","article-title":"Anonymous biometric access control based on homomorphic\n  encryption","author":"Ying Luo","year":"2009"},{"key":"ref51:clear2013homomorphic","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-38553-7_4","article-title":"Homomorphic encryption with access policies:\n  Characterization and new constructions","author":"Michael Clear","year":"2013"},{"key":"ref52:hingwe2016hierarchical","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-981-10-0135-2_43","article-title":"Hierarchical role-based access control with homomorphic\n  encryption for database as a service","author":"Kamlesh Kumar Hingwe","year":"2016"},{"key":"ref53:verma2022access","doi-asserted-by":"publisher","first-page":"78","DOI":"10.52710\/rjcse.46","article-title":"Access Control-Based Cloud Storage Using Role-Fully\n  Homomorphic Encryption Scheme","volume":"3","author":"Neha Verma","year":"2022","journal-title":"Research Journal of Computer Systems and Engineering"},{"key":"ref54:saxena2023role","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1007\/s13198-023-01896-2","article-title":"Role-based access using partial homomorphic encryption for\n  securing cloud data","volume":"14","author":"Urvashi Rahul Saxena","year":"2023","journal-title":"International Journal of System Assurance Engineering and\n  Management"},{"key":"ref55:shamir1979share","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Adi Shamir","year":"1979","journal-title":"Communications of the ACM"},{"key":"ref56:naor1999privacy","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/336992.337028","article-title":"Privacy preserving auctions and mechanism design","author":"Moni Naor","year":"1999"},{"key":"ref57:naor2005computationally","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","article-title":"Computationally secure oblivious transfer","volume":"18","author":"Moni Naor","year":"2005","journal-title":"Journal of Cryptology"},{"key":"ref58:kolesnikov2016efficient","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1145\/2976749.2978381","article-title":"Efficient batched oblivious PRF with applications to private\n  set intersection","author":"Vladimir Kolesnikov","year":"2016"},{"key":"ref59:Hopcroft","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/568438.568455","article-title":"Introduction to automata theory, languages, and\n  computation","volume":"32","author":"John E Hopcroft","year":"2001","journal-title":"Acm Sigact News"},{"key":"ref60:stadler1996publicly","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","article-title":"Publicly verifiable secret sharing","author":"Markus Stadler","year":"1996"},{"key":"ref61:cascudo2024publicly","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-68339-9_17","article-title":"Publicly verifiable secret sharing over class groups and\n  applications to DKG and YOSO","author":"Ignacio Cascudo","year":"2024"},{"key":"ref62:USENIX:ECZB211","first-page":"1775","article-title":"Express: Lowering the Cost of Metadata-hiding Communication\n  with Cryptographic Privacy","author":"Saba Eskandarian","year":"2021"},{"key":"ref63:USENIX:NewSchDev22","first-page":"229","article-title":"Spectrum: High-bandwidth anonymous broadcast","author":"Zachary Newman","year":"2022"},{"key":"ref64:peikert2008framework","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","article-title":"A framework for efficient and composable oblivious\n  transfer","author":"Chris Peikert","year":"2008"},{"key":"ref65:SP:BBBPWM18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/SP.2018.00020","article-title":"Bulletproofs: Short Proofs for Confidential Transactions and\n  More","author":"Benedikt B\u00fcnz","year":"2018"},{"key":"ref66:cini2023lattice","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-031-38545-2_3","article-title":"Lattice-based succinct arguments from vanishing\n  polynomials","author":"Valerio Cini","year":"2023"},{"key":"ref67:C:BBHR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","article-title":"Scalable Zero Knowledge with No Trusted Setup","volume":"11694","author":"Eli Ben-Sasson","year":"2019"},{"key":"ref68:C:BLNS20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-56880-1_16","article-title":"A Non-PCP Approach to Succinct Quantum-Safe\n  Zero-Knowledge","volume":"12171","author":"Jonathan Bootle","year":"2020"},{"key":"ref69:TCC:BenChiSpo16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","article-title":"Interactive Oracle Proofs","volume":"9986","author":"Eli Ben-Sasson","year":"2016"},{"key":"ref70:TCC:ChiManSpo19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-36033-7_1","article-title":"Succinct Arguments in the Quantum Random Oracle Model","volume":"11892","author":"Alessandro Chiesa","year":"2019"},{"key":"ref71:C:GLSTW23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-031-38545-2_7","article-title":"Brakedown: Linear-Time and Field-Agnostic SNARKs for\n  R1CS","volume":"14082","author":"Alexander Golovnev","year":"2023"},{"key":"ref72:xie2022orion","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-031-15985-5_11","article-title":"Orion: Zero knowledge proof with linear prover time","author":"Tiancheng Xie","year":"2022"},{"key":"ref73:mohassel2012efficient","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-27954-6_25","article-title":"An efficient protocol for oblivious DFA evaluation and\n  applications","author":"Payman Mohassel","year":"2012"},{"key":"ref74:niksefat2014zids","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1093\/comjnl\/bxt019","article-title":"ZIDS: A privacy-preserving intrusion detection system using\n  secure two-party computation protocols","volume":"57","author":"Salman Niksefat","year":"2014","journal-title":"The Computer Journal"},{"key":"ref75:nguyen2024greyhound","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-031-68403-6_8","article-title":"Greyhound: Fast polynomial commitments from lattices","author":"Ngoc Khanh Nguyen","year":"2024"},{"key":"ref76:cini2024polynomial","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-031-68403-6_7","article-title":"Polynomial commitments from lattices: post-quantum security,\n  fast verification and transparent setup","author":"Valerio Cini","year":"2024"},{"key":"ref77:C:ACFY24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-031-68403-6_12","article-title":"STIR: Reed-Solomon Proximity Testing with Fewer Queries","author":"Gal Arnon","year":"2024"},{"key":"ref78:abdolmaleki2025generic","article-title":"A Generic Framework for Practical Lattice-Based\n  Non-interactive Publicly Verifiable Secret Sharing","author":"Behzad Abdolmaleki","year":"2025","journal-title":"Cryptology ePrint Archive"},{"key":"ref79:pacl","volume-title":"Post-Quantum Access Control Implementation","year":"2025"},{"key":"ref80:risc0","volume-title":"Risc0","year":"2024"},{"key":"ref81:CiteDrive2022","volume-title":"C++ DPF-PIR library","year":"2021"},{"key":"ref82:ben2018fast","doi-asserted-by":"publisher","first-page":"14","DOI":"10.4230\/LIPIcs.ICALP.2018.14","article-title":"Fast reed-solomon interactive oracle proofs of proximity","author":"Eli Ben-Sasson","year":"2018"},{"key":"ref83:corrigan2017prio","first-page":"259","article-title":"Prio: Private, robust, and scalable computation of aggregate\n  statistics","author":"Henry Corrigan-Gibbs","year":"2017"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T20:22:58Z","timestamp":1759782178000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/3\/20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":83,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,10,6]]}},"URL":"https:\/\/doi.org\/10.62056\/akmpxrdja","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"2025-07-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-3-33"}}