default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd EUROCRYPT 2023: Lyon, France - Part III
- Carmit Hazay
, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III. Lecture Notes in Computer Science 14006, Springer 2023, ISBN 978-3-031-30619-8
Differential Privacy
- Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. 3-34 - Itai Dinur, Uri Stemmer, David P. Woodruff, Samson Zhou:
On Differential Privacy and Adaptive Data Analysis with Bounded Space. 35-65
Compromise-Resilient Cryptographic Primitives
- Suvradip Chakraborty, Dennis Hofheinz, Ueli Maurer, Guilherme Rito:
Deniable Authentication When Signing Keys Leak. 69-100 - Joseph Jaeger:
Let Attackers Program Ideal Models: Modularity and Composability for Adaptive Compromise. 101-131 - Shuai Han, Shengli Liu, Dawu Gu:
Almost Tight Multi-user Security Under Adaptive Corruptions & Leakages in the Standard Model. 132-162 - Rupeng Yang:
Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness. 163-193 - Geoffroy Couteau, Pierre Meyer, Alain Passelègue, Mahshid Riahinia:
Constrained Pseudorandom Functions from Homomorphic Secret Sharing. 194-224
Advanced Public Key Primitives
- Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo:
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. 227-256 - Robin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren:
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. 257-286 - Leo de Castro, Chris Peikert:
Functional Commitments for All Functions, with Transparent Setup and from SIS. 287-320 - Feng-Hao Liu, Han Wang:
Batch Bootstrapping I: - A New Framework for SIMD Bootstrapping in Polynomial Modulus. 321-352 - Feng-Hao Liu, Han Wang:
Batch Bootstrapping II: - Bootstrapping in Polynomial Modulus only Requires O~(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{O}(1)$$\end{document} FHE Multiplications in Amortization. 353-384 - Hoeteck Wee, David J. Wu:
Succinct Vector, Polynomial, and Functional Commitments from Lattices. 385-416 - Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Laconic Cryptography from Learning with Errors. 417-446 - Pratish Datta, Ilan Komargodski, Brent Waters:
Fully Adaptive Decentralized Multi-Authority ABE. 447-478 - Aayush Jain, Huijia Lin, Ji Luo:
On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. 479-510 - Susan Hohenberger, George Lu, Brent Waters, David J. Wu:
Registered Attribute-Based Encryption. 511-542 - Junichi Tomida:
Unbounded Quadratic Functional Encryption and More from Pairings. 543-572 - Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi:
Multi-key and Multi-input Predicate Encryption from Learning with Errors. 573-604 - Shweta Agrawal, Simran Kumari, Anshu Yadav, Shota Yamada:
Broadcast, Trace and Revoke with Optimal Parameters from Polynomial Hardness. 605-636 - Junqing Gong, Ji Luo, Hoeteck Wee:
Traitor Tracing with N1/3-Size Ciphertexts and O(1)-Size Keys from k-Lin. 637-668
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 2024-11-27 20:15 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:
