| 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 |
| Slide Reduction, Revisited—Filling the Gaps in SVP Approximation
|
2020 |
Aggarwal, Divesh |
| A Key-Recovery Timing Attack on Post-quantum Primitives Using the Fujisaki-Okamoto Transformation and Its Application on FrodoKEM
|
2020 |
Guo, Qian |
| Practical Product Proofs for Lattice Commitments
|
2020 |
Attema, Thomas |
| Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
|
2020 |
Baum, Carsten |
| Round-Optimal Black-Box Commit-and-Prove with Succinct Communication
|
2020 |
Kiyoshima, Susumu |
| Guaranteed Output Delivery Comes Free in Honest Majority MPC
|
2020 |
Goyal, Vipul |
| Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits
|
2020 |
Escudero, Daniel |
| Fast Reduction of Algebraic Lattices over Cyclotomic Fields
|
2020 |
Kirchner, Paul |
| Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory
|
2020 |
Castryck, Wouter |
| 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 |
Tag hinzufügen