| New Ways to Garble Arithmetic Circuits
|
2023 |
Ball, Marshall |
| Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead
|
2023 |
Applebaum, Benny |
| Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time
|
2023 |
Abraham, Ittai |
| Supersingular Curves You Can Trust
|
2023 |
Basso, Andrea |
| Maliciously-Secure MrNISC in the Plain Model
|
2023 |
Fernando, Rex |
| SUPERPACK: Dishonest Majority MPC with Constant Online Communication
|
2023 |
Escudero, Daniel |
| Proof-Carrying Data from Arithmetized Random Oracles
|
2023 |
Chen, Megan |
| SNARGs and PPAD Hardness from the Decisional Diffie-Hellman assumption
|
2023 |
Kalai, Yael Tauman |
| Privacy-Preserving Blueprints
|
2023 |
Kohlweiss, Markulf |
| Actively Secure Half-Gates with Minimum Overhead Under Duplex Networks
|
2023 |
Cui, Hongrui |
| Minimizing Setup in Broadcast-Optimal Two Round MPC
|
2023 |
Damgard, Ivan |
| An Incremental PoOSW for General Weight Distributions
|
2023 |
Abusalah, Hamza |
| Spartan and Bulletproofs are Simulation-Extractable (for Free!)
|
2023 |
Dao, Quang |
| HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates
|
2023 |
Chen, Binyi |
| Black-Box Reusable NISC with Random Oracles
|
2023 |
Ishai, Yuval |
| Sublinear-Communication Secure Multiparty Computation Does Not Requite FHE
|
2023 |
Boyle, Elette |
| Witness-Succinct Universally-Composable SNARKs
|
2023 |
Ganesh, Chaya |
| Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions
|
2023 |
Goel, Aarushi |
| On Valiant’s Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles
|
2023 |
Hall-Andersen, Mathias |
| Complete Characterization of Broadcast and Pseudo-signatures from Correlations
|
2023 |
Narayanan, Varun |
Tag hinzufügen