Folgen
Daniel Masny
Daniel Masny
Meta
Bestätigte E-Mail-Adresse bei fb.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On the hardness of learning with rounding over small modulus
A Bogdanov, S Guo, D Masny, S Richelson, A Rosen
Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015
1192015
Optimal security proofs for signatures from identification schemes
E Kiltz, D Masny, J Pan
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
802016
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
542014
New constructions of identity-based and key-dependent message secure encryption schemes
N Döttling, S Garg, M Hajiabadi, D Masny
Public-Key Cryptography–PKC 2018: 21st IACR International Conference on …, 2018
532018
Man-in-the-middle secure authentication schemes from LPN and weak PRFs
V Lyubashevsky, D Masny
Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013
522013
Two-round oblivious transfer from CDH or LPN
N Döttling, S Garg, M Hajiabadi, D Masny, D Wichs
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
432020
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
352016
Endemic oblivious transfer
D Mansy, P Rindal
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
312019
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
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
142018
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
132019
Chosen-ciphertext security from subset sum
S Faust, D Masny, D Venturi
Public-Key Cryptography–PKC 2016: 19th IACR International Conference on …, 2016
122016
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
112020
Naor–Yung paradigm with shared randomness and applications
S Biagioni, D Masny, D Venturi
Theoretical Computer Science 692, 90-113, 2017
62017
Leakage-resilient cryptography over large finite fields: Theory and practice
M Andrychowicz, D Masny, E Persichetti
Applied Cryptography and Network Security: 13th International Conference …, 2015
52015
On removing rejection conditions in practical lattice-based signatures
R Behnia, Y Chen, D Masny
Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021 …, 2021
42021
Schnorr signatures in the multi-user setting
E Kiltz, D Masny, J Pan
Cryptology ePrint Archive, 2015
42015
Secure Multi-Party Computation from Strongly Uniform Key Agreement.
D Friolo, D Masny, D Venturi
IACR Cryptol. ePrint Arch. 2018, 473, 2018
22018
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH
S Badrinarayanan, D Masny, P Mukherjee, S Patranabis, S Raghuraman, ...
Cryptology ePrint Archive, 2022
12022
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
12021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20