Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st TCC 2023: Taipei, Taiwan - Part III
- Guy N. Rothblum
, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part III. Lecture Notes in Computer Science 14371, Springer 2023, ISBN 978-3-031-48620-3
Anonymity, Surveillance and Tampering
- Willy Quach, LaKyah Tyner, Daniel Wichs:
Lower Bounds on Anonymous Whistleblowing. 3-32 - Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. 33-61 - Rex Fernando, Elaine Shi, Pratik Soni, Nikhil Vanjani, Brent Waters:
Non-Interactive Anonymous Router with Quasi-Linear Router Computation. 62-92 - Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance. 93-122 - Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak:
Efficiently Testable Circuits Without Conductivity. 123-152 - Marshall Ball, Yevgeniy Dodis, Eli Goldin:
Immunizing Backdoored PRGs. 153-182
Lower Bounds
- Mi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang:
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments. 185-206 - Marc Fischlin, Felix Rohrbach:
Searching for ELFs in the Cryptographic Forest. 207-236 - Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. 237-270 - Benedikt Auerbach, Miguel Cueto Noval, Guillermo Pascual-Perez, Krzysztof Pietrzak:
On the Cost of Post-compromise Security in Concurrent Continuous Group-Key Agreement. 271-300 - Benedikt Auerbach, Charlotte Hoffmann, Guillermo Pascual-Perez:
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing. 301-330
IOPs and Succinctness
- Susumu Kiyoshima:
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors. 333-362 - David Balbás, Dario Catalano, Dario Fiore, Russell W. F. Lai:
Chainable Functional Commitments for Unbounded-Depth Circuits. 363-393 - Benedikt Bünz, Ben Fisch:
Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments. 394-423 - Thomas Attema, Serge Fehr, Nicolas Resch:
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. 424-454 - Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac:
From Polynomial IOP and Commitments to Non-malleable zkSNARKs. 455-485 - Markulf Kohlweiss, Mahak Pancholi, Akira Takahashi:
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. 486-512
a service of 
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-04-26 18:34 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:
