TCC (3)

Keyphrases

Publications

2023

Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky
Anonymous Permutation Routing. TCC (3) (2023)
Marshall Ball, Yevgeniy Dodis, Eli Goldin
Immunizing Backdoored PRGs. TCC (3) (2023)
Marc Fischlin, Felix Rohrbach
Searching for ELFs in the Cryptographic Forest. TCC (3) (2023)
David Balbás, Dario Catalano, Dario Fiore, Russell W. F. Lai
Chainable Functional Commitments for Unbounded-Depth Circuits. TCC (3) (2023)
Benedikt Auerbach, Charlotte Hoffmann, Guillermo Pascual-Perez
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing. TCC (3) (2023)
Benedikt Auerbach, Miguel Cueto Noval, Guillermo Pascual-Perez, Krzysztof Pietrzak
On the Cost of Post-compromise Security in Concurrent Continuous Group-Key Agreement. TCC (3) (2023)
Willy Quach, LaKyah Tyner, Daniel Wichs
Lower Bounds on Anonymous Whistleblowing. TCC (3) (2023)
Jiaxin Guan, Daniel Wichs, Mark Zhandry
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance. TCC (3) (2023)
Rex Fernando, Elaine Shi, Pratik Soni, Nikhil Vanjani, Brent Waters
Non-Interactive Anonymous Router with Quasi-Linear Router Computation. TCC (3) (2023)
Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. TCC (3) (2023)
Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak
Efficiently Testable Circuits Without Conductivity. TCC (3) (2023)
Benedikt Bünz, Ben Fisch
Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments. TCC (3) (2023)
Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac
From Polynomial IOP and Commitments to Non-malleable zkSNARKs. TCC (3) (2023)
Mi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments. TCC (3) (2023)
Thomas Attema, Serge Fehr, Nicolas Resch
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. TCC (3) (2023)
Markulf Kohlweiss, Mahak Pancholi, Akira Takahashi
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. TCC (3) (2023)
Susumu Kiyoshima
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors. TCC (3) (2023)

volume 14371, 2023

Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part III TCC (3) 14371 (2023)

2022

volume 13749, 2022

Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part III TCC (3) 13749 (2022)

2021

volume 13044, 2021

Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part III TCC (3) 13044 (2021)

2020

volume 12552, 2020

Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III TCC (3) 12552 (2020)