Daniel Masny

According to our database1, Daniel Masny authored at least 27 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Delegated Private Matching for Compute.
IACR Cryptol. ePrint Arch., 2023

Interoperable Private Attribution: A Distributed Attribution and Aggregation Protocol.
IACR Cryptol. ePrint Arch., 2023

Non-Observable Quantum Random Oracle Model.
Proceedings of the Post-Quantum Cryptography - 14th International Workshop, 2023

Round-Optimal Oblivious Transfer and MPC from Computational CSIDH.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022
On the Quantum Security of OCB.
IACR Cryptol. ePrint Arch., 2022

Efficient and Tight Oblivious Transfer from PKE with Tight Multi-user Security.
Proceedings of the Applied Cryptography and Network Security, 2022

2021
On Removing Rejection Conditions in Practical Lattice-Based Signatures.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

A PKI-based Framework for Establishing Efficient MPC Channels.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Reusable Two-Round MPC from DDH.
IACR Cryptol. ePrint Arch., 2020

Reusable Two-Round MPC from DDH.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Two-Round Oblivious Transfer from CDH or LPN.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Endemic Oblivious Transfer.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Secure Multi-Party Computation from Strongly Uniform Key Agreement.
IACR Cryptol. ePrint Arch., 2018

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

On the Round Complexity of OT Extension.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Authentication from Weak PRFs with Hidden Auxiliary Input.
IACR Cryptol. ePrint Arch., 2017

2016
Cryptography from hard learning problems.
PhD thesis, 2016

On the Hardness of Learning with Rounding over Small Modulus.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Naor-Yung Paradigm with Shared Randomness and Applications.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Chosen-Ciphertext Security from Subset Sum.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Optimal Security Proofs for Signatures from Identification Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Simple Chosen-Ciphertext Security from Low-Noise LPN.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

2013
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2011
Block cipher based security for severely resource-constrained implantable medical devices.
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, 2011


  Loading...