| Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment.
|
2020 |
Boudot, Fabrice |
| Scalable Pseudorandom Quantum States
|
2020 |
Brakerski, Zvika |
| Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing
|
2020 |
Maji, Hemanta K. |
| MPC with Friends and Foes
|
2020 |
Alon, Bar |
| A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem
|
2020 |
Coron, Jean-Sebastien |
| Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields
|
2020 |
Micheli, Gabrielle De |
| Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/2k Time kk/8+o(k)
|
2020 |
Albrecht, Martin R. |
| Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP
|
2020 |
Mukherjee, Tamalika |
| Rounding in the Rings
|
2020 |
Liu, Feng-Hao |
| LWE with Side Information: Attacks and Concrete Security EstimationDana Dachman-Soled, Léo Ducas, Huijing Gong, and Mélissa Rossi
|
2020 |
Dachman-Soled, Dana |
| Efficient Pseudorandom Correlation Generators from Ring-LPN
|
2020 |
Boyle, Elette |
| A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge
|
2020 |
Bootle, Jonathan |
| Lattice-Based Blind Signatures, Revisited
|
2020 |
Hauck, Eduard |
| Black-Box Transformations from Passive to Covert Security with Public Verifiability
|
2020 |
Damgadrd, Ivan |
| Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback
|
2020 |
Blum, Erica |
| Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path
|
2020 |
Heath, David |
| Reverse Firewalls for Actively Secure MPCSs
|
2020 |
Chakraborty, Suvradip |
| Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)
|
2020 |
Guo, Chun |
| A Classification of Computational Assumptions in the Algebraic Group Model
|
2020 |
Bauer, Balthazar |
| Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
|
2020 |
Pellet-Mary,, Koen de Boer, Léo Ducas, Alice |
Tag hinzufügen