default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st TCC 2023: Taipei, Taiwan - Part IV
- Guy N. Rothblum
, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV. Lecture Notes in Computer Science 14372, Springer 2023, ISBN 978-3-031-48623-4
Lattices
- Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Rigorous Foundations for Dual Attacks in Coding Theory. 3-32 - Roman Langrehr:
On the Multi-user Security of LWE-Based NIKE. 33-62 - Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski:
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. 63-92 - Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan:
Revocable Cryptography from Learning with Errors. 93-122
Quantum Cryptography
- Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli:
Pseudorandomness with Proof of Destruction and Applications. 125-154 - Céline Chevalier, Paul Hermouet, Quoc-Huy Vu:
Semi-quantum Copy-Protection and More. 155-182 - James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter:
Weakening Assumptions for Publicly-Verifiable Deletion. 183-197 - Khashayar Barooti, Alex B. Grilo, Loïs Huguenin-Dumittan, Giulio Malavolta, Or Sattath, Quoc-Huy Vu, Michael Walter:
Public-Key Encryption with Quantum Keys. 198-227 - Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa:
Publicly Verifiable Deletion from Minimal Assumptions. 228-245 - Fuyuki Kitagawa, Ryo Nishimaki:
One-Out-of-Many Unclonable Cryptography: Definitions, Constructions, and More. 246-275
Group-Based Cryptography
- Dominik Hartmann, Eike Kiltz:
Limits in the Provable Security of ECDSA Signatures. 279-309 - Daniele Cozzo, Emanuele Giunta:
Round-Robin is Optimal: Lower Bounds for Group Action Based Protocols. 310-335 - Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák:
(Verifiable) Delay Functions from Lucas Sequences. 336-362 - Helger Lipmaa, Roberto Parisella, Janno Siim:
Algebraic Group Model with Oblivious Sampling. 363-392
Byzantine Agreement, Consensus and Composability
- Julian Loss, Gilad Stern:
Zombies and Ghosts: Optimal Byzantine Agreement in the Presence of Omission Faults. 395-421 - Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. 422-451 - Benjamin Y. Chan, Rafael Pass:
Simplex Consensus: A Simple and Fast Consensus Protocol. 452-479 - Christian Badertscher, Michele Ciampi, Aggelos Kiayias:
Agile Cryptography: A Universally Composable Approach. 480-509 - Robin Berger, Brandon Broadnax, Michael Klooß, Jeremias Mechler, Jörn Müller-Quade, Astrid Ottenhues, Markus Raiber:
Composable Long-Term Security with Rewinding. 510-541
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-05-01 23:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
