From Polynomial IOP and Commitments to Non-malleable zkSNARKS

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	TCC (21. : 2023 : Taipeh) Theory of cryptography ; Part 3
1. Verfasser:	Faonio, Antonio (VerfasserIn)
Weitere Verfasser:	Fiore, Dario (VerfasserIn), Kohlweiss, Markulf (VerfasserIn), Russo, Luigi (VerfasserIn), Zajac, Michal (VerfasserIn)
Pages:	3
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2023
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Lower Bounds on Anonymous Whistleblowing	2023	Quach, Willy
Immunizing Backdoored PRGs	2023	Ball, Marshall
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance	2023	Guan, Jiaxin
Searching for ELFs in the Cryptographic Forest	2023	Fischlin, Marc
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors	2023	Kiyoshima, Susumu
Chainable Functional Commitments for Unbounded-Depth Circuits	2023	Balás, David
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness	2023	Attema, Thomas
Non-Interactive Anonymous Router with Quasi-Linear Router Computation	2023	Fernando, Rex
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions	2023	Akshima
On the Cost of Post-compromise Security in Concurrent Continuous Group-Key Areement	2023	Auerbach, Benedikt
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments	2023	Huang, Mi-Ying
From Polynomial IOP and Commitments to Non-malleable zkSNARKS	2023	Faonio, Antonio
Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments	2023	Bünz, Benedikt
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach	2023	Kohlweiss, Markulf
Anonymous Permutation Routing	2023	Bunn, Paul
Efficiently Testable Circuits Without Conductivity	2023	Baig, Mirza Ahad
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing	2023	Auerbach, Benedikt