| Two-Sided Malicious Security for Private Intersection-Sum with Cardinality
|
2020 |
Miao, Peihan |
| Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF
|
2020 |
Chase, Melissa |
| Non-malleability Against Polynomial Tampering
|
2020 |
Ball, Marshall |
| Cryptanalysis of LEDAcrypt
|
2020 |
Apon, Daniel |
| Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics
|
2020 |
Attema, Thomas |
| Order-Fairness for Byzantine Consensus
|
2020 |
Kelkar, Mahimna |
| New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust
|
2020 |
Ball, Marshall |
| Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages
|
2020 |
Couteau, Geoffroy |
| Nearly Optimal Robust Secret Sharing Against Rushing Adversaries
|
2020 |
Manurangsi, Pasin |
| Alzette: A 64-Bit ARX-box: (Feat. CRAX and TRAX)
|
2020 |
Beierle, Christof |
| Cryptanalysis Results on Spook: Bringing Full-Round Shadow-512 to the Light
|
2020 |
Derbez, Patrick |
| Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions
|
2020 |
Rotem, Lior |
| Interactive Proofs for Social Graphs
|
2020 |
Katzir, Liran |
| The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More
|
2020 |
Don, Jelle |
| A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence
|
2020 |
Berman, Itay |
| Multiparty Generation of an RSA Modulus
|
2020 |
Chen, Megan |
| Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model
|
2020 |
Brian, Gianluca |
| The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers
|
2020 |
Peyrin, Thomas |
| Cryptanalytic Extraction of Neural Network Models
|
2020 |
Carlini, Nicholas |
| Cryptanalysis of the Lifted Unbalanced Oil Vinegar Signature Scheme
|
2020 |
Ding, Jintai |
Tag hinzufügen