| Secure Quantum Extraction Protocols
|
2020 |
Ananth, Prabhanjan |
| Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
|
2020 |
Dai, Wei |
| New Techniques in Replica Encodings with Client Setup
|
2020 |
Garg, Rachit |
| On Pseudorandom Encodings
|
2020 |
Agrikola, Thomas |
| Security Analysis of SPAKE2
|
2020 |
Shoup, Victor |
| Lower Bounds on the Time/Memory Tradeoff of Function Inversion
|
2020 |
Chawin, Dror |
| Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
|
2020 |
Rotem, Lior |
| Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness
|
2020 |
Jaeger, Joseph |
| Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
|
2020 |
Fehr, Serge |
| On Average-Case Hardness in TFNP from One-Way Functions
|
2020 |
Hubácek, Pavel |
| Schrödinger's Pirate: How to Trace a Quantum Decoder
|
2020 |
Zhandry, Mark |
| Quantum Encryption with Certified Deletion
|
2020 |
Broadbent, Anne |
| Non-interactive Classical Verification of Quantum Computation
|
2020 |
Alagic, Gorjan |
| Coupling of Random Systems
|
2020 |
Lanzenberger, David |
| Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity
|
2020 |
Dodis, Yevgeniy |
| Zero-Communication Reduction
|
2020 |
Narayanan, Varun |
| On the Complexity of Arıthmetic Secret Sharing
|
2020 |
Cramer, Ronald |
| The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
|
2020 |
Beimel, Amos |
| Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering
|
2020 |
Chattopadhyay, Eshan |
| Universal Composition with Global Subroutines: Capturing Global Setup Within Plain UC
|
2020 |
Badertscher, Christian |
Tag hinzufügen