| The Round Complexity of Quantum Zero-Knowledge
|
2021 |
Chardouvelis, Orestis |
| Rate-1 Quantum Fully Homomorphic Encryption
|
2021 |
Chardouvelis, Orestis |
| Quantum Key-Length Extension
|
2021 |
Jaeger, Joseph |
| Fully-Succinet Publicly Verifiable Delegation from Constant-Size Assumptions
|
2021 |
Gonzdález, Alonso |
| Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback
|
2021 |
Deligios, Giovanni |
| Adaptive Security of Multi-party Protocols, Revisited
|
2021 |
Hirt, Martin |
| Secure Software Leasing Without Assumptions
|
2021 |
Broadbent, Anne |
| Post-quantum Resettably-Sound Zero Knowledge
|
2021 |
Bitansky, Nir |
| Unifying Presampling via Concentration Bounds
|
2021 |
Guo, Siyao |
| Classical Binding for Quantum Commitments
|
2021 |
Bitansky, Nir |
| Relationships Between Quantum IND-CPA Notions
|
2021 |
Carstens, Tore Vincent |
| Unclonable Encryption, Revisited
|
2021 |
Ananth, Prabhanjan |
| Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs
|
2021 |
Kalai, Yael Tauman |
| Tight Security Bounds for Micali’s SNARGs
|
2021 |
Chiesa, Alessandro |
| Generalized Proofs of Knowledge with Fully Dynamic Setup
|
2021 |
Badertscher, Christian |
| On Expected Polynomial Runtime in Cryptography
|
2021 |
Klooß, Michael |
| Secure Quantum Computation with Classical Communication
|
2021 |
Bartusek, James |
| Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness
|
2021 |
Kiyoshima, Susumu |
| Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
|
2021 |
Agarwal, Amit |
| Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) Assumptions
|
2021 |
Broadnax, Brandon |
Tag hinzufügen