default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th ASIACRYPT 2021: Singapore - Part III
- Mehdi Tibouchi
, Huaxiong Wang:
Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part III. Lecture Notes in Computer Science 13092, Springer 2021, ISBN 978-3-030-92077-7
NIZK and SNARKs
- Matteo Campanelli, Antonio Faonio, Dario Fiore, Anaïs Querol, Hadrián Rodríguez:
Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. 3-33 - Helger Lipmaa, Kateryna Pavlyk:
Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG. 34-64 - Benedikt Bünz, Mary Maller, Pratyush Mishra, Nirvan Tyagi, Psi Vesely:
Proofs for Inner Pairing Products and Applications. 65-97 - Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov:
Snarky Ceremonies. 98-127 - Geoffroy Couteau, Helger Lipmaa, Roberto Parisella, Arne Tobias Ødegaard:
Efficient NIZKs for Algebraic Sets. 128-158
Theory
- Shun Watanabe, Kenji Yasunaga:
Bit Security as Computational Cost for Winning Games with High Probability. 161-188 - Ueli Maurer, Christopher Portmann, Guilherme Rito:
Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework). 189-219 - Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, Rafail Ostrovsky:
How to Build a Trapdoor Function from an Encryption Scheme. 220-249 - Rishab Goyal, Sam Kim, Brent Waters, David J. Wu:
Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions. 250-280 - Ian McQuoid, Mike Rosulek, Lawrence Roy:
Batching Base Oblivious Transfers. 281-310 - Michel Abdalla, Manuel Barbosa, Jonathan Katz, Julian Loss, Jiayu Xu:
Algebraic Adversaries in the Universal Composability Framework. 311-341
Symmetric-Key Constructions
- Srimanta Bhattacharya, Mridul Nandi:
Luby-Rackoff Backwards with More Users and More Security. 345-375 - Yusuke Naito, Yu Sasaki, Takeshi Sugawara:
Double-Block-Length Hash Function for Minimum Memory Size. 376-406 - Wonseok Choi, ByeongHak Lee, Jooyoung Lee, Yeongmin Lee:
Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation. 407-434 - Stefano Tessaro, Xihu Zhang:
Tight Security for Key-Alternating Ciphers with Correlated Sub-keys. 435-464 - F. Betül Durak, Henning Horst, Michael Horst, Serge Vaudenay:
FAST: Secure and High Performance Format-Preserving Encryption and Tokenization. 465-489 - Soumya Chattopadhyay, Ashwin Jha, Mridul Nandi:
Fine-Tuning the ISO/IEC Standard LightMAC. 490-519 - Yu Long Chen, Bart Mennink, Bart Preneel:
Categorization of Faulty Nonce Misuse Resistant Message Authentication. 520-550
Homomorphic Encryption and Encrypted Search
- Marc Joye:
Balanced Non-adjacent Forms. 553-576 - Sarvar Patel, Giuseppe Persiano, Joon Young Seo, Kevin Yeo:
Efficient Boolean Search over Encrypted Data with Reduced Leakage. 577-607 - Andrey Kim, Yuriy Polyakov, Vincent Zucca:
Revisiting Homomorphic Encryption Schemes for Finite Fields. 608-639 - Jihoon Cho, Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Joohee Lee, Jooyoung Lee, Dukjae Moon, Hyojin Yoon:
Transciphering Framework for Approximate Homomorphic Encryption. 640-669 - Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap:
Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE. 670-699
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 2025-03-04 20:54 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
