default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th ACNS 2026: Stony Brook, NY, USA - Part I
- Kangkook Jee, Aniket Kate:
Applied Cryptography and Network Security - 24th International Conference, ACNS 2026, Stony Brook, NY, USA, June 22-25, 2026, Proceedings, Part I. Lecture Notes in Computer Science 16571, Springer 2027, ISBN 978-3-032-32559-4
Post-quantum Cryptography
- Zuming Liu, Yanhong Xu
, Deng Tang, Neng Zeng:
Efficient Post-quantum EPID Signatures From VOLE-in-the-Head. 3-31 - Gorjan Alagic, Fahran Bajaj, Aybars Kocoglu:
The Best of Both KEMs: Securely Combining KEMs in Post-quantum Hybrid Schemes. 32-74 - Toi Tomita:
Towards More Efficient Registration-Based Encryption from LWE. 75-98 - Priyanka Dutta, Willy Susilo, Fuchun Guo, Dung Hoang Duong:
Dynamic Puncturable Encryption. 99-130 - Vir Pathak, Sushmita Ruj:
A Post Quantum Vector Commitment Scheme with Efficient Insertions and Deletions. 131-157 - Dung Hoang Duong, Thanh Xuan Khuc, Youming Qiao, Willy Susilo, Chuanqi Zhang:
(Partially) Blind Signatures from Cryptographic Group Actions. 158-186 - Pradyun Parayil, Amal Raj, Vivek Balachandran:
Protecting Quantum Circuits Through Compiler-Resistant Obfuscation. 187-208
Cryptographic Primitives and Proof Systems
- Yusuke Naito, Yu Sasaki, Takeshi Sugawara:
Tight Multi-user Security of CCM and Enhancement by Tag-Based Key Derivation. 211-240 - Jing Liu, Liang Feng Zhang:
FlexProofs: A Vector Commitment with Flexible Linear Time for Computing All Proofs. 241-271 - Vojtech Suchanek, Marek Sýs, Lukasz Chmielewski:
Faster Signature Verification with 3-Dimensional Decomposition. 272-296 - Yu Wang, Yuncong Zhang, Yu Chen:
Efficient Sum-Check for High-Degree Polynomials. 297-326 - Matteo Campanelli:
Practical Subvector Commitments with Optimal Opening Complexity. 327-350 - Shancheng Zhang, Zongyang Zhang, Bernardo Magri:
The Cost of Fluidity: Communication Complexity Trade-Offs in Fluid MPC. 351-381 - Carlos Cid, Alex Davidson, Atharva Phanse:
Practice-Oriented Instances of Deterministic LPN. 382-412
Secure Protocols and Multi-party Computation
- Wasilij Beskorovajnov, Jörn Müller-Quade:
How to Kickstart $\mathcal {F}_{\textrm{SMT}}^{S\rightarrow R}$ with Short Authentication Strings and Out-of-Band Communication. 415-443 - Yingfei Yan, Khai Hanh Tang, Hien Chu, Sherman S. M. Chow, San Ling, Huaxiong Wang, Kai Zhang:
Sovereign Modal Signatures. 444-472 - Offir Friedman, Avichai Marmor, Dolev Mutzari, Yehonatan C. Scaly, Yuval Spiizer:
Practical Zero-Trust Threshold Signatures in Large-Scale Asynchronous Networks. 473-500 - Sophie Hawkes, Christian Weinert:
SoK: Outsourced Private Set Intersection. 501-527 - Ferran Alborch, Tom Chauvier, Antonio Faonio, Alexandre Fontaine, Ferhat Karakoç, Alptekin Küpçü, Camille Malek, Melek Önen:
Updatable Private Set Intersection and Beyond: Efficient Constructions via Circuit PSI. 528-558 - Xavier Bultel, Khouredia Cisse:
Round-Optimal Privacy Preserving Authenticated Key Exchange Even for Incomplete Sessions. 559-584
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-06 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
