Characterizing Deterministic-Prover Zero Knowledge

von Bitansky, Nir
Veröffentlicht in Theory of Cryptography Conference (18. : 2020 : Online) Theory of cryptography ; Part 1 (2020)

Non-interactive Batch Arguments for NP from Standard Assumptions

von Choudhuri, Arka Rai
Veröffentlicht in CRYPTO (41. : 2021 : Online) Advances in cryptology - CRYPTO 2021 ; Part 4 (2021)

The Round Complexity of Secure Computation Against Covert Adversaries

von Choudhuri, Arka Rai
Veröffentlicht in SCN (12. : 2020 : Amalfi, Provinz Salerno; Online) Security and cryptography for networks (2020)

Towards Efficiency-Preserving Round Compression in MPC: Do Fewer Rounds Mean More Computation?

von Ananth, Prabhanjan
Veröffentlicht in ASIACRYPT (26. : 2020 : Online) Advances in cryptology - ASIACRYPT 2020 ; Part 3 (2020)

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds

von Choudhuri, Arka Rai
Veröffentlicht in Theory of Cryptography Conference (19. : 2021 : Raleigh, NC) Theory of cryptography ; Part 2 (2021)

Fluid MPC: Secure Multiparty Computation with Dynamic Participants

von Choudhuri, Arka Rai
Veröffentlicht in CRYPTO (41. : 2021 : Online) Advances in cryptology - CRYPTO 2021 ; Part 2 (2021)

Round Optimal Secure Multiparty Computation from Minimal Assumptions

von Choudhuri, Arka Rai
Veröffentlicht in Theory of Cryptography Conference (18. : 2020 : Online) Theory of cryptography ; Part 2 (2020)

Correlation Intractability and SNARGs from Sub-exponential DDH

von Choudhuri, Arka Rai
Veröffentlicht in International Cryptology Conference (43. : 2023 : Santa Barbara, Calif.) Advances in cryptology - CRYPTO 2023 ; Part 4 (2023)

PPAD is as Hard as LWE and Iterated Squaring

von Bitansky, Nir
Veröffentlicht in Theory of Cryptography Conference (20. : 2022 : Chicago, Ill.) Theory of cryptography ; Part 2 (2022)