Seguir
Daniel Masny
Daniel Masny
Meta
Dirección de correo verificada de fb.com - Página principal
Título
Citado por
Citado por
Año
On the hardness of learning with rounding over small modulus
A Bogdanov, S Guo, D Masny, S Richelson, A Rosen
Theory of Cryptography Conference, 209-224, 2015
1432015
Optimal security proofs for signatures from identification schemes
E Kiltz, D Masny, J Pan
Annual International Cryptology Conference, 33-61, 2016
1072016
New constructions of identity-based and key-dependent message secure encryption schemes
N Döttling, S Garg, M Hajiabadi, D Masny
IACR International Workshop on Public Key Cryptography, 3-31, 2018
632018
Simple chosen-ciphertext security from low-noise LPN
E Kiltz, D Masny, K Pietrzak
Public-Key Cryptography–PKC 2014: 17th International Conference on Practice …, 2014
612014
Two-round oblivious transfer from CDH or LPN
N Döttling, S Garg, M Hajiabadi, D Masny, D Wichs
Annual International Conference on the Theory and Applications of …, 2020
552020
Man-in-the-middle secure authentication schemes from LPN and weak PRFs
V Lyubashevsky, D Masny
Annual Cryptology Conference, 308-325, 2013
552013
Endemic oblivious transfer
D Mansy, P Rindal
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
442019
Towards sound fresh re-keying with hard (physical) learning problems
S Dziembowski, S Faust, G Herold, A Journault, D Masny, FX Standaert
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
442016
Block cipher based security for severely resource-constrained implantable medical devices
C Beck, D Masny, W Geiselmann, G Bretthauer
Proceedings of the 4th International Symposium on Applied Sciences in …, 2011
272011
On the round complexity of OT extension
S Garg, M Mahmoody, D Masny, I Meckler
Annual International Cryptology Conference, 545-574, 2018
192018
Reusable two-round MPC from DDH
J Bartusek, S Garg, D Masny, P Mukherjee
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
172020
A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
D Friolo, D Masny, D Venturi
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
142019
Chosen-ciphertext security from subset sum
S Faust, D Masny, D Venturi
Public-Key Cryptography–PKC 2016: 19th IACR International Conference on …, 2016
132016
Round-optimal oblivious transfer and MPC from computational CSIDH
S Badrinarayanan, D Masny, P Mukherjee, S Patranabis, S Raghuraman, ...
IACR International Conference on Public-Key Cryptography, 376-405, 2023
112023
Fast oblivious transfers
DSW Masny, PB Rindal
US Patent 11,190,496, 2021
102021
On the quantum security of OCB
V Maram, D Masny, S Patranabis, S Raghuraman
IACR Transactions on Symmetric Cryptology 2022 (2), 379-414, 2022
82022
Naor–Yung paradigm with shared randomness and applications
S Biagioni, D Masny, D Venturi
Theoretical Computer Science 692, 90-113, 2017
72017
On removing rejection conditions in practical lattice-based signatures
R Behnia, Y Chen, D Masny
Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021 …, 2021
62021
Interoperable private attribution: A distributed attribution and aggregation protocol
B Case, R Jain, A Koshelev, A Leiserson, D Masny, T Sandberg, ...
Cryptology ePrint Archive, 2023
52023
A PKI-based framework for establishing efficient MPC channels
D Masny, G Watson
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
52021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20