default search action
Daniel Masny
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Dimitris Mouris, Daniel Masny, Ni Trieu, Shubho Sengupta, Prasad Buddhavarapu, Benjamin M. Case:
Delegated Private Matching For Compute. Proc. Priv. Enhancing Technol. 2024(2): 49-72 (2024) - 2023
- [c20]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee
, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. Public Key Cryptography (1) 2023: 376-405 - [c19]Navid Alamati, Varun Maram
Non-Observable Quantum Random Oracle Model. PQCrypto 2023: 417-444 - [i23]Dimitris Mouris, Daniel Masny, Ni Trieu, Shubho Sengupta, Prasad Buddhavarapu, Benjamin M. Case:
Delegated Private Matching for Compute. IACR Cryptol. ePrint Arch. 2023: 12 (2023) - [i22]Benjamin M. Case, Richa Jain, Alex Koshelev, Andy Leiserson, Daniel Masny, Ben Savage, Erik Taubeneck, Martin Thomson, Taiki Yamaguchi:
Interoperable Private Attribution: A Distributed Attribution and Aggregation Protocol. IACR Cryptol. ePrint Arch. 2023: 437 (2023) - [i21]Navid Alamati, Varun Maram, Daniel Masny:
Non-Observable Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2023: 1126 (2023) - 2022
- [j2]Varun Maram
On the Quantum Security of OCB. IACR Trans. Symmetric Cryptol. 2022(2): 379-414 (2022) - [c18]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee:
Efficient and Tight Oblivious Transfer from PKE with Tight Multi-user Security. ACNS 2022: 626-642 - [i20]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee:
Efficient and Tight Oblivious Transfer from PKE with Tight Multi-User Security. IACR Cryptol. ePrint Arch. 2022: 415 (2022) - [i19]Varun Maram, Daniel Masny, Sikhar Patranabis, Srinivasan Raghuraman:
On the Quantum Security of OCB. IACR Cryptol. ePrint Arch. 2022: 699 (2022) - [i18]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. IACR Cryptol. ePrint Arch. 2022: 1511 (2022) - 2021
- [c17]Daniel Masny, Gaven J. Watson:
A PKI-based Framework for Establishing Efficient MPC Channels. CCS 2021: 1961-1980 - [c16]Rouzbeh Behnia, Yilei Chen, Daniel Masny:
On Removing Rejection Conditions in Practical Lattice-Based Signatures. PQCrypto 2021: 380-398 - [i17]Rouzbeh Behnia, Yilei Chen, Daniel Masny:
On Removing Rejection Conditions in Practical Lattice-Based Signatures. IACR Cryptol. ePrint Arch. 2021: 924 (2021) - [i16]Daniel Masny, Gaven J. Watson:
A PKI-based Framework for Establishing Efficient MPC Channels. IACR Cryptol. ePrint Arch. 2021: 1627 (2021) - 2020
- [c15]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs:
Two-Round Oblivious Transfer from CDH or LPN. EUROCRYPT (2) 2020: 768-797 - [c14]James Bartusek
Reusable Two-Round MPC from DDH. TCC (2) 2020: 320-348 - [i15]Saikrishna Badrinarayanan, James Bartusek, Sanjam Garg
Reusable Two-Round MPC from DDH. IACR Cryptol. ePrint Arch. 2020: 170 (2020)
2010 – 2019
- 2019
- [c13]Daniel Masny, Peter Rindal:
Endemic Oblivious Transfer. CCS 2019: 309-326 - [c12]Daniele Friolo
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement. TCC (1) 2019: 111-130 - [i14]Nico Döttling, Sanjam Garg
Two-Round Oblivious Transfer from CDH or LPN. IACR Cryptol. ePrint Arch. 2019: 414 (2019) - [i13]Daniel Masny, Peter Rindal:
Endemic Oblivious Transfer. IACR Cryptol. ePrint Arch. 2019: 706 (2019) - 2018
- [c11]Sanjam Garg, Mohammad Mahmoody
On the Round Complexity of OT Extension. CRYPTO (3) 2018: 545-574 - [c10]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny:
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. Public Key Cryptography (1) 2018: 3-31 - [i12]Daniele Friolo, Daniel Masny, Daniele Venturi:
Secure Multi-Party Computation from Strongly Uniform Key Agreement. IACR Cryptol. ePrint Arch. 2018: 473 (2018) - 2017
- [j1]Silvio Biagioni, Daniel Masny, Daniele Venturi
Naor-Yung paradigm with shared randomness and applications. Theor. Comput. Sci. 692: 90-113 (2017) - [i11]Daniel Masny:
Authentication from Weak PRFs with Hidden Auxiliary Input. IACR Cryptol. ePrint Arch. 2017: 834 (2017) - [i10]Nico Döttling, Sanjam Garg
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. IACR Cryptol. ePrint Arch. 2017: 978 (2017) - [i9]Sanjam Garg
On the Round Complexity of OT Extension. IACR Cryptol. ePrint Arch. 2017: 1187 (2017) - 2016
- [b1]Daniel Masny:
Cryptography from hard learning problems. Ruhr University Bochum, Germany, 2016 - [c9]Eike Kiltz
Optimal Security Proofs for Signatures from Identification Schemes. CRYPTO (2) 2016: 33-61 - [c8]Stefan Dziembowski, Sebastian Faust, Gottfried Herold, Anthony Journault, Daniel Masny, François-Xavier Standaert
Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems. CRYPTO (2) 2016: 272-301 - [c7]Sebastian Faust, Daniel Masny, Daniele Venturi
Chosen-Ciphertext Security from Subset Sum. Public Key Cryptography (1) 2016: 35-46 - [c6]Silvio Biagioni, Daniel Masny, Daniele Venturi
Naor-Yung Paradigm with Shared Randomness and Applications. SCN 2016: 62-80 - [c5]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) 2016: 209-224 - [i8]Eike Kiltz, Daniel Masny, Jiaxin Pan:
Optimal Security Proofs for Signatures from Identification Schemes. IACR Cryptol. ePrint Arch. 2016: 191 (2016) - [i7]Stefan Dziembowski
Towards Sound Fresh Re-Keying with Hard (Physical) Learning Problems. IACR Cryptol. ePrint Arch. 2016: 573 (2016) - [i6]Silvio Biagioni, Daniel Masny, Daniele Venturi:
Naor-Yung Paradigm with Shared Randomness and Applications. IACR Cryptol. ePrint Arch. 2016: 880 (2016) - 2015
- [c4]Marcin Andrychowicz, Daniel Masny, Edoardo Persichetti
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice. ACNS 2015: 655-674 - [i5]Marcin Andrychowicz, Daniel Masny, Edoardo Persichetti:
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice. IACR Cryptol. ePrint Arch. 2015: 317 (2015) - [i4]Eike Kiltz, Daniel Masny, Krzysztof Pietrzak:
Simple Chosen-Ciphertext Security from Low-Noise LPN. IACR Cryptol. ePrint Arch. 2015: 401 (2015) - [i3]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. IACR Cryptol. ePrint Arch. 2015: 769 (2015) - [i2]Sebastian Faust, Daniel Masny, Daniele Venturi:
Chosen-Ciphertext Security from Subset Sum. IACR Cryptol. ePrint Arch. 2015: 1223 (2015) - 2014
- [c3]Eike Kiltz
Simple Chosen-Ciphertext Security from Low-Noise LPN. Public Key Cryptography 2014: 1-18 - 2013
- [c2]Vadim Lyubashevsky, Daniel Masny:
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. CRYPTO (2) 2013: 308-325 - [i1]Vadim Lyubashevsky, Daniel Masny:
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. IACR Cryptol. ePrint Arch. 2013: 92 (2013) - 2011
- [c1]Christoph Beck, Daniel Masny, Willi Geiselmann, Georg Bretthauer:
Block cipher based security for severely resource-constrained implantable medical devices. ISABEL 2011: 62:1-62:5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-22 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: