The following pages link to Daniel Masny (Q775995):
Displaying 16 items.
- On the round complexity of OT extension (Q775997) (← links)
- New constructions of identity-based and key-dependent message secure encryption schemes (Q1749271) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Reusable two-round MPC from DDH (Q2119050) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice (Q2794525) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Chosen-Ciphertext Security from Subset Sum (Q2798769) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs (Q2849403) (← links)
- Simple Chosen-Ciphertext Security from Low-Noise LPN (Q5402961) (← links)
