| Public-Coi n Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
|
2020 |
Block, Alexander R. |
| Secure Massively Parallel Computation for Dishonest Majority
|
2020 |
Fernando, Rex |
| Reusable Two-Round MPC from DDH
|
2020 |
Bartusek, James |
| On Statistical Security in Two-Party Computation
|
2020 |
Khurana, Dakshita |
| On the Power of an Honest Majority in Three-Party Computation Without Broadcast
|
2020 |
Alon, Bar |
| A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity
|
2020 |
Cascudo, Ignacio |
| Linear-Time Arguments with Sublinear Verification from Tensor Codes
|
2020 |
Bootle, Jonathan |
| Continuous Group Key Agreement with Active Security
|
2020 |
Alwen, Joel |
| The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
|
2020 |
Applebaum, Benny |
| Barriers for Succinct Arguments 1n the Random Oracle Model
|
2020 |
Chiesa, Alessandro |
| Batch Verification for Statistical Zero Knowledge Proofs
|
2020 |
Kaslasi, Inbar |
| Batch Verification and Proofs of Proximity with Polylog Overhead
|
2020 |
Rothblum, Guy N. |
| Round Optimal Secure Multiparty Computation from Minimal Assumptions
|
2020 |
Choudhuri, Arka Rai |
| Towards Multiparty Computation Withstanding Coercion of All Parties
|
2020 |
Canetti, Ran |
| Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures
|
2020 |
Dachman-Soled, Dana |
| On the Round Complexity of the Shuffle Model
|
2020 |
Beimel, Amos |
| Topology-Hiding Communication from Minimal Assumptions
|
2020 |
Ball, Marshall |
| Recursive Proof Composition from Accumulation Schemes
|
2020 |
Bünz, Benedikt |
| Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction
|
2020 |
Schul-Ganz, Gili |
| Stronger Security and Constructions of Multi-designated Verifier Signatures
|
2020 |
Damgard, Ivan |
Tag hinzufügen