Dana Dachman-Soled
Dana Glasner
https://user.eng.umd.edu/~danadach/
https://scholar.google.com/citations?user=Ss009KUAAAAJ
https://mathscinet.ams.org/mathscinet/MRAuthorID/871922
https://mathgenealogy.org/id.php?id=225991
https://orcid.org/0000-0001-6797-641X
https://www.wikidata.org/entity/Q102790392
University of Maryland, College Park, MD, USA
Yvonne Zhou
Mingyu Liang
Ivan Brugere
Dana Dachman-Soled
Danial Dervovic
Antigoni Polychroniadou
Min Wu 0001
Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data.
2024
abs/2402.04375
CoRR
https://doi.org/10.48550/arXiv.2402.04375
db/journals/corr/corr2402.html#abs-2402-04375
Dana Dachman-Soled
Huijing Gong
Tom Hanson
Hunter Kippen
Revisiting Security Estimation for LWE with Hints from a Geometric Perspective.
748-781
2023
CRYPTO (5)
https://doi.org/10.1007/978-3-031-38554-4_24
conf/crypto/2023-5
db/conf/crypto/crypto2023-5.html#DachmanSoledGHK22
Marshall Ball
Eli Goldin
Dana Dachman-Soled
Saachi Mutreja
Extracting Randomness from Samplable Distributions, Revisited.
1505-1514
2023
FOCS
https://doi.org/10.1109/FOCS57990.2023.00092
conf/focs/2023
db/conf/focs/focs2023.html#BallGDM23
Zachary McBride Lazri
Ivan Brugere
Xin Tian
Dana Dachman-Soled
Antigoni Polychroniadou
Danial Dervovic
Min Wu 0001
A Canonical Data Transformation for Achieving Inter- and Within-group Fairness.
2023
abs/2310.15097
CoRR
https://doi.org/10.48550/arXiv.2310.15097
db/journals/corr/corr2310.html#abs-2310-15097
Marshall Ball
Dana Dachman-Soled
(Inefficient Prover) ZAPs from Hard-to-Invert Functions.
TR23-205
2023
TR23
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2023/205
db/journals/eccc/eccc2023.html#BallD23
Marshall Ball
Dana Dachman-Soled
Eli Goldin
Saachi Mutreja
Extracting Randomness from Samplable Distributions, Revisited.
TR23-169
2023
TR23
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2023/169
db/journals/eccc/eccc2023.html#BallDGM23
Seung Geol Choi
Dana Dachman-Soled
Mingyu Liang
Linsheng Liu
Arkady Yerukhimovich
On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash Sketching.
1523
2023
2023
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2023/1523
db/journals/iacr/iacr2023.html#ChoiDLLY23
Michael Fahr
Hunter Kippen
Andrew Kwong
Thinh Dang
Jacob Lichtinger
Dana Dachman-Soled
Daniel Genkin
Alexander Nelson
Ray A. Perlner
Arkady Yerukhimovich
Daniel Apon
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer.
979-993
2022
CCS
https://doi.org/10.1145/3548606.3560673
conf/ccs/2022
db/conf/ccs/ccs2022.html#FahrKKDLDGNPYA22
Marshall Ball
Dana Dachman-Soled
Julian Loss
(Nondeterministic) Hardness vs. Non-malleability.
148-177
2022
CRYPTO (1)
https://doi.org/10.1007/978-3-031-15802-5_6
conf/crypto/2022-1
db/conf/crypto/crypto2022-1.html#BallDL22
Seung Geol Choi
Dana Dachman-Soled
S. Dov Gordon
Linsheng Liu
Arkady Yerukhimovich
Secure Sampling with Sublinear Communication.
348-377
2022
TCC (2)
https://doi.org/10.1007/978-3-031-22365-5_13
conf/tcc/2022-2
db/conf/tcc/tcc2022-2.html#ChoiDGLY22
Dana Dachman-Soled
3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA.
ITC
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2022
LIPIcs
230
978-3-95977-238-9
https://www.dagstuhl.de/dagpub/978-3-95977-238-9
db/conf/citc/citc2022.html
Marshall Ball
Dana Dachman-Soled
Julian Loss
(Nondeterministic) Hardness vs. Non-Malleability.
TR22-010
2022
TR22
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2022/010
db/journals/eccc/eccc2022.html#BallDL22
Marshall Ball
Dana Dachman-Soled
Julian Loss
(Nondeterministic) Hardness vs. Non-Malleability.
70
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/070
db/journals/iacr/iacr2022.html#BallDL22
Dana Dachman-Soled
Seung Geol Choi
S. Dov Gordon
Linsheng Liu
Arkady Yerukhimovich
Secure Sampling with Sublinear Communication.
660
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/660
db/journals/iacr/iacr2022.html#Dachman-SoledCG22
Michael Fahr
Hunter Kippen
Andrew Kwong
Thinh Dang
Jacob Lichtinger
Dana Dachman-Soled
Daniel Genkin
Alexander Nelson
Ray A. Perlner
Arkady Yerukhimovich
Daniel Apon
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer.
952
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/952
db/journals/iacr/iacr2022.html#FahrKKDLDGNPYA22
Dana Dachman-Soled
Julian Loss
Adam O'Neill
Nikki Sigurdson
Breaking RSA Generically is Equivalent to Factoring, with Preprocessing.
1261
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/1261
db/journals/iacr/iacr2022.html#Dachman-SoledLO22
Dana Dachman-Soled
Huijing Gong
Tom Hanson
Hunter Kippen
Refined Security Estimation for LWE with Hints via a Geometric Approach.
1345
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/1345
db/journals/iacr/iacr2022.html#Dachman-SoledGH22
Dana Dachman-Soled
Huijing Gong
Mukul Kulkarni
Aria Shahverdi
(In)Security of Ring-LWE Under Partial Key Exposure.
72-86
2021
15
J. Math. Cryptol.
1
https://doi.org/10.1515/jmc-2020-0075
db/journals/jmc/jmc15.html#Dachman-SoledGK20
Dana Dachman-Soled
Huijing Gong
Mukul Kulkarni
Aria Shahverdi
Towards a Ring Analogue of the Leftover Hash Lemma.
87-110
2021
15
J. Math. Cryptol.
1
https://doi.org/10.1515/jmc-2020-0076
db/journals/jmc/jmc15.html#Dachman-SoledGK20a
Seung Geol Choi
Dana Dachman-Soled
S. Dov Gordon
Linsheng Liu
Arkady Yerukhimovich
Compressed Oblivious Encoding for Homomorphically Encrypted Search.
2277-2291
2021
CCS
https://doi.org/10.1145/3460120.3484792
conf/ccs/2021
db/conf/ccs/ccs2021.html#ChoiDGLY21
Dana Dachman-Soled
Ilan Komargodski
Rafael Pass
Non-malleable Codes for Bounded Parallel-Time Tampering.
535-565
2021
CRYPTO (3)
https://doi.org/10.1007/978-3-030-84252-9_18
conf/crypto/2021-3
db/conf/crypto/crypto2021-3.html#Dachman-SoledKP21
Dana Dachman-Soled
Huijing Gong
Hunter Kippen
Aria Shahverdi
BKW Meets Fourier New Algorithms for LPN with Sparse Parities.
658-688
2021
TCC (2)
https://doi.org/10.1007/978-3-030-90453-1_23
conf/tcc/2021-2
db/conf/tcc/tcc2021-2.html#Dachman-SoledGK21
Aria Shahverdi
Mahammad Shirinov
Dana Dachman-Soled
Database Reconstruction from Noisy Volumes: A Cache Side-Channel Attack on SQLite.
1019-1035
2021
USENIX Security Symposium
https://www.usenix.org/conference/usenixsecurity21/presentation/shahverdi
conf/uss/2021
db/conf/uss/uss2021.html#ShahverdiSD21
Seung Geol Choi
Dana Dachman-Soled
S. Dov Gordon
Linsheng Liu
Arkady Yerukhimovich
Compressed Oblivious Encoding for Homomorphically Encrypted Search.
2021
abs/2109.07708
CoRR
https://arxiv.org/abs/2109.07708
db/journals/corr/corr2109.html#abs-2109-07708
Dana Dachman-Soled
Huijing Gong
Hunter Kippen
Aria Shahverdi
BKW Meets Fourier: New Algorithms for LPN with Sparse Parities.
994
2021
2021
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2021/994
db/journals/iacr/iacr2021.html#Dachman-SoledGK21
Seung Geol Choi
Dana Dachman-Soled
S. Dov Gordon
Linsheng Liu
Arkady Yerukhimovich
Compressed Oblivious Encoding for Homomorphically Encrypted Search.
1199
2021
2021
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2021/1199
db/journals/iacr/iacr2021.html#ChoiDGLY21
Dana Dachman-Soled
Feng-Hao Liu
Elaine Shi
Hong-Sheng Zhou
Locally Decodable and Updatable Non-malleable Codes and Their Applications.
319-355
2020
33
J. Cryptol.
1
https://doi.org/10.1007/s00145-018-9306-z
db/journals/joc/joc33.html#Dachman-SoledLS20
Dana Dachman-Soled
Nils Fleischhacker
Jonathan Katz
Anna Lysyanskaya
Dominique Schröder
Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
595-617
2020
33
J. Cryptol.
2
https://doi.org/10.1007/s00145-019-09329-9
db/journals/joc/joc33.html#Dachman-SoledFK20
Seung Geol Choi
Dana Dachman-Soled
Mukul Kulkarni
Arkady Yerukhimovich
Differentially-Private Multi-Party Sketching for Large-Scale Statistics.
153-174
2020
2020
Proc. Priv. Enhancing Technol.
3
https://doi.org/10.2478/popets-2020-0047
db/journals/popets/popets2020.html#ChoiDKY20
Dana Dachman-Soled
Léo Ducas
Huijing Gong
Mélissa Rossi
LWE with Side Information: Attacks and Concrete Security Estimation.
329-358
2020
CRYPTO (2)
https://doi.org/10.1007/978-3-030-56880-1_12
conf/crypto/2020-2
db/conf/crypto/crypto2020-2.html#Dachman-SoledDG20
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust.
674-703
2020
CRYPTO (3)
https://doi.org/10.1007/978-3-030-56877-1_24
conf/crypto/2020-3
db/conf/crypto/crypto2020-3.html#BallDK20
John Kelsey
Dana Dachman-Soled
Sweta Mishra
Meltem Sönmez Turan
TMPS: Ticket-Mediated Password Strengthening.
225-253
2020
CT-RSA
https://doi.org/10.1007/978-3-030-40186-3_11
conf/ctrsa/2020
db/conf/ctrsa/ctrsa2020.html#KelseyDMT20
Sanghyun Hong 0001
Michael Davinroy
Yigitcan Kaya
Dana Dachman-Soled
Tudor Dumitras
How to 0wn the NAS in Your Spare Time.
2020
ICLR
https://openreview.net/forum?id=S1erpeBFPB
conf/iclr/2020
db/conf/iclr/iclr2020.html#HongDKDD20
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Limits to Non-Malleability.
80:1-80:32
2020
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2020.80
conf/innovations/2020
db/conf/innovations/innovations2020.html#BallDKM20
Dana Dachman-Soled
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures.
595-620
2020
TCC (2)
https://doi.org/10.1007/978-3-030-64378-2_21
conf/tcc/2020-2
db/conf/tcc/tcc2020-2.html#Dachman-Soled20
Sanghyun Hong 0001
Michael Davinroy
Yigitcan Kaya
Dana Dachman-Soled
Tudor Dumitras
How to 0wn NAS in Your Spare Time.
2020
abs/2002.06776
CoRR
https://arxiv.org/abs/2002.06776
db/journals/corr/corr2002.html#abs-2002-06776
Aria Shahverdi
Mahammad Shirinov
Dana Dachman-Soled
Database Reconstruction from Noisy Volumes: A Cache Side-Channel Attack on SQLite.
2020
abs/2006.15007
CoRR
https://arxiv.org/abs/2006.15007
db/journals/corr/corr2006.html#abs-2006-15007
Mingliang Chen
Aria Shahverdi
Sarah Anderson
Se Yong Park
Justin Zhang 0004
Dana Dachman-Soled
Kristin E. Lauter
Min Wu 0001
Transparency Tools for Fairness in AI (Luskin).
2020
abs/2007.04484
CoRR
https://arxiv.org/abs/2007.04484
db/journals/corr/corr2007.html#abs-2007-04484
Seung Geol Choi
Dana Dachman-Soled
Mukul Kulkarni
Arkady Yerukhimovich
Differentially-Private Multi-Party Sketching for Large-Scale Statistics.
29
2020
2020
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2020/029
db/journals/iacr/iacr2020.html#ChoiDKY20
Dana Dachman-Soled
Léo Ducas
Huijing Gong
Mélissa Rossi
LWE with Side Information: Attacks and Concrete Security Estimation.
292
2020
2020
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2020/292
db/journals/iacr/iacr2020.html#Dachman-SoledDG20
Dana Dachman-Soled
Ilan Komargodski
Rafael Pass
Non-Malleable Codes for Bounded Polynomial Depth Tampering.
776
2020
2020
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2020/776
db/journals/iacr/iacr2020.html#Dachman-SoledKP20
Dana Dachman-Soled
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures.
1430
2020
2020
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2020/1430
db/journals/iacr/iacr2020.html#Dachman-Soled20
Dana Dachman-Soled
Mukul Kulkarni
Aria Shahverdi
Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes.
2019
268
Inf. Comput.
https://doi.org/10.1016/j.ic.2019.05.001
db/journals/iandc/iandc268.html#Dachman-SoledKS19
Dana Dachman-Soled
S. Dov Gordon
Feng-Hao Liu
Adam O'Neill
Hong-Sheng Zhou
Leakage Resilience from Program Obfuscation.
742-824
2019
32
J. Cryptol.
3
https://doi.org/10.1007/s00145-018-9286-z
db/journals/joc/joc32.html#Dachman-SoledGL19
Dana Dachman-Soled
Chang Liu 0021
Charalampos Papamanthou
Elaine Shi
Uzi Vishkin
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.
941-972
2019
32
J. Cryptol.
3
https://doi.org/10.1007/s00145-018-9301-4
db/journals/joc/joc32.html#Dachman-SoledLP19
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Huijia Lin
Tal Malkin
Non-Malleable Codes Against Bounded Polynomial Time Tampering.
501-530
2019
EUROCRYPT (1)
https://doi.org/10.1007/978-3-030-17653-2_17
conf/eurocrypt/2019-1
db/conf/eurocrypt/eurocrypt2019-1.html#BallDKLM19
Yuntao Liu 0001
Dana Dachman-Soled
Ankur Srivastava 0001
Mitigating Reverse Engineering Attacks on Deep Neural Networks.
657-662
2019
ISVLSI
https://doi.org/10.1109/ISVLSI.2019.00122
https://www.wikidata.org/entity/Q115409116
conf/isvlsi/2019
db/conf/isvlsi/isvlsi2019.html#0001DS19
Dana Dachman-Soled
Mukul Kulkarni
Upper and Lower Bounds for Continuous Non-Malleable Codes.
519-548
2019
Public Key Cryptography (1)
https://doi.org/10.1007/978-3-030-17253-4_18
conf/pkc/2019-1
db/conf/pkc/pkc2019-1.html#Dachman-SoledK19
Daniel Apon
Dana Dachman-Soled
Huijing Gong
Jonathan Katz
Constant-Round Group Key Exchange from the Ring-LWE Assumption.
189-205
2019
PQCrypto
https://doi.org/10.1007/978-3-030-25510-7_11
conf/pqcrypto/2019
db/conf/pqcrypto/pqcrypto2019.html#AponDGK19
Daniel Apon
Dana Dachman-Soled
Huijing Gong
Jonathan Katz
Constant-Round Group Key Exchange from the Ring-LWE Assumption.
398
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/398
db/journals/iacr/iacr2019.html#AponDGK19
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Limits to Non-Malleability.
449
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/449
db/journals/iacr/iacr2019.html#BallDKM19
John Kelsey
Dana Dachman-Soled
Sweta Mishra
Meltem Sönmez Turan
TMPS: Ticket-Mediated Password Strengthening.
543
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/543
db/journals/iacr/iacr2019.html#KelseyDMT19
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction.
1464
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/1464
db/journals/iacr/iacr2019.html#BallDK19
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
Improved, black-box, non-malleable encryption from semantic security.
641-663
2018
86
Des. Codes Cryptogr.
3
https://doi.org/10.1007/s10623-017-0348-2
https://www.wikidata.org/entity/Q122918086
db/journals/dcc/dcc86.html#ChoiDMW18
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption.
172-201
2018
31
J. Cryptol.
1
https://doi.org/10.1007/s00145-017-9254-z
https://www.wikidata.org/entity/Q121225270
db/journals/joc/joc31.html#ChoiDMW18
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering.
618-650
2018
EUROCRYPT (3)
https://doi.org/10.1007/978-3-319-78372-7_20
conf/eurocrypt/2018-3
db/conf/eurocrypt/eurocrypt2018-3.html#BallDKM18
Marshall Ball
Dana Dachman-Soled
Siyao Guo
Tal Malkin
Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits.
826-837
2018
FOCS
https://doi.org/10.1109/FOCS.2018.00083
https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00083
conf/focs/2018
db/conf/focs/focs2018.html#BallDGMT18
Dana Dachman-Soled
Mukul Kulkarni
Aria Shahverdi
Local Non-malleable Codes in the Bounded Retrieval Model.
281-311
2018
Public Key Cryptography (2)
https://doi.org/10.1007/978-3-319-76581-5_10
conf/pkc/2018-2
db/conf/pkc/pkc2018-2.html#Dachman-SoledKS18
Marshall Ball
Dana Dachman-Soled
Siyao Guo
Tal Malkin
Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits.
2018
abs/1802.07673
CoRR
http://arxiv.org/abs/1802.07673
db/journals/corr/corr1802.html#abs-1802-07673
Sanghyun Hong 0001
Michael Davinroy
Yigitcan Kaya
Stuart Nevans Locke
Ian Rackow
Kevin Kulda
Dana Dachman-Soled
Tudor Dumitras
Security Analysis of Deep Neural Networks Operating in the Presence of Cache Side-Channel Attacks.
2018
abs/1810.03487
CoRR
http://arxiv.org/abs/1810.03487
db/journals/corr/corr1810.html#abs-1810-03487
Marshall Ball
Dana Dachman-Soled
Siyao Guo
Tal Malkin
Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits.
TR18-040
2018
TR18
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2018/040
db/journals/eccc/eccc25.html#BallDGMT18
Marshall Ball
Dana Dachman-Soled
Siyao Guo
Tal Malkin
Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits.
207
2018
2018
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2018/207
db/journals/iacr/iacr2018.html#BallDGMT18
Dana Dachman-Soled
Mukul Kulkarni
Upper and Lower Bounds for Continuous Non-Malleable Codes.
517
2018
2018
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2018/517
db/journals/iacr/iacr2018.html#Dachman-SoledK18
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Huijia Lin
Tal Malkin
Non-Malleable Codes Against Bounded Polynomial Time Tampering.
1015
2018
2018
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2018/1015
db/journals/iacr/iacr2018.html#BallDKLM18
Dana Dachman-Soled
Huijing Gong
Mukul Kulkarni
Aria Shahverdi
Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience.
1068
2018
2018
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2018/1068
db/journals/iacr/iacr2018.html#Dachman-SoledGK18
Dana Dachman-Soled
Mukul Kulkarni
Aria Shahverdi
Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes.
310-332
2017
Public Key Cryptography (1)
https://doi.org/10.1007/978-3-662-54365-8_13
conf/pkc/2017-1
db/conf/pkc/pkc2017-1.html#Dachman-SoledKS17
Dana Dachman-Soled
Mukul Kulkarni
Aria Shahverdi
Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes.
15
2017
2017
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2017/015
db/journals/iacr/iacr2017.html#Dachman-SoledKS17
Dana Dachman-Soled
Mukul Kulkarni
Aria Shahverdi
Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model.
303
2017
2017
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2017/303
db/journals/iacr/iacr2017.html#Dachman-SoledKS17a
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering.
1061
2017
2017
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2017/1061
db/journals/iacr/iacr2017.html#BallDKM17
Dana Dachman-Soled
Huijing Gong
Mukul Kulkarni
Aria Shahverdi
On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption.
1127
2017
2017
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2017/1127
db/journals/iacr/iacr2017.html#Dachman-SoledGK17
Chongwon Cho
Dana Dachman-Soled
Stanislaw Jarecki
Efficient Concurrent Covert Computation of String Equality and Set Intersection.
164-179
2016
CT-RSA
https://doi.org/10.1007/978-3-319-29485-8_10
conf/ctrsa/2016
db/conf/ctrsa/ctrsa2016.html#ChoDJ16
Dana Dachman-Soled
Jonathan Katz
Aishwarya Thiruvengadam
10-Round Feistel is Indifferentiable from an Ideal Cipher.
649-678
2016
EUROCRYPT (2)
https://doi.org/10.1007/978-3-662-49896-5_23
https://www.wikidata.org/entity/Q56270823
conf/eurocrypt/2016-2
db/conf/eurocrypt/eurocrypt2016-2.html#Dachman-SoledKT16
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits.
881-908
2016
EUROCRYPT (2)
https://doi.org/10.1007/978-3-662-49896-5_31
conf/eurocrypt/2016-2
db/conf/eurocrypt/eurocrypt2016-2.html#BallDKM16
Dana Dachman-Soled
S. Dov Gordon
Feng-Hao Liu
Adam O'Neill
Hong-Sheng Zhou
Leakage-Resilient Public-Key Encryption from Obfuscation.
101-128
2016
Public Key Cryptography (2)
https://doi.org/10.1007/978-3-662-49387-8_5
conf/pkc/2016-2
db/conf/pkc/pkc2016-2.html#Dachman-SoledGL16
Dana Dachman-Soled
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function.
169-191
2016
TCC (B2)
https://doi.org/10.1007/978-3-662-53644-5_7
conf/tcc/2016b2
db/conf/tcc/tcc2016b2.html#Dachman-Soled16
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits.
307
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/307
db/journals/iacr/iacr2016.html#BallDKM16
Dana Dachman-Soled
Angela Park
Ben San Nicolas
Towards a Characterization of the Related-Key Attack Security of the Iterated Even-Mansour Cipher.
707
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/707
db/journals/iacr/iacr2016.html#Dachman-SoledPN16
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption.
720
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/720
db/journals/iacr/iacr2016.html#ChoiDMW16
Dana Dachman-Soled
S. Dov Gordon
Feng-Hao Liu
Adam O'Neill
Hong-Sheng Zhou
Leakage-Resilient Public-Key Encryption from Obfuscation.
730
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/730
db/journals/iacr/iacr2016.html#Dachman-SoledGL16
Dana Dachman-Soled
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function.
812
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/812
db/journals/iacr/iacr2016.html#Dachman-Soled16
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
Improved, Black-Box, Non-Malleable Encryption from Semantic Security.
842
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/842
db/journals/iacr/iacr2016.html#ChoiDMW16a
Dana Dachman-Soled
Chang Liu 0021
Charalampos Papamanthou
Elaine Shi
Uzi Vishkin
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.
337-359
2015
ASIACRYPT (1)
https://doi.org/10.1007/978-3-662-48797-6_15
conf/asiacrypt/2015-1
db/conf/asiacrypt/asiacrypt2015-1.html#Dachman-SoledLP15
Dana Dachman-Soled
Feng-Hao Liu
Hong-Sheng Zhou
Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components Without Leak-Free Hardware.
131-158
2015
EUROCRYPT (2)
https://doi.org/10.1007/978-3-662-46803-6_5
conf/eurocrypt/2015-2
db/conf/eurocrypt/eurocrypt2015-2.html#Dachman-SoledLZ15
Dana Dachman-Soled
Vitaly Feldman
Li-Yang Tan
Andrew Wan
Karl Wimmer
Approximate resilience, monotonicity, and the complexity of agnostic learning.
498-511
2015
SODA
https://doi.org/10.1137/1.9781611973730.34
conf/soda/2015
db/conf/soda/soda2015.html#Dachman-SoledFTWW15
Dana Dachman-Soled
Feng-Hao Liu
Elaine Shi
Hong-Sheng Zhou
Locally Decodable and Updatable Non-malleable Codes and Their Applications.
427-450
2015
TCC (1)
https://doi.org/10.1007/978-3-662-46494-6_18
conf/tcc/2015-1
db/conf/tcc/tcc2015-1.html#Dachman-SoledLS15
Dana Dachman-Soled
Jonathan Katz
Vanishree Rao
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds.
586-613
2015
TCC (2)
https://doi.org/10.1007/978-3-662-46497-7_23
conf/tcc/2015-2
db/conf/tcc/tcc2015-2.html#Dachman-SoledKR15
Dana Dachman-Soled
Chang Liu 0021
Charalampos Papamanthou
Elaine Shi
Uzi Vishkin
Oblivious Network RAM.
73
2015
2015
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2015/073
db/journals/iacr/iacr2015.html#Dachman-SoledLPSV15
Dana Dachman-Soled
Nils Fleischhacker
Jonathan Katz
Anna Lysyanskaya
Dominique Schröder
Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
405
2015
2015
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2015/405
db/journals/iacr/iacr2015.html#Dachman-SoledFK15
Dana Dachman-Soled
Jonathan Katz
Aishwarya Thiruvengadam
10-Round Feistel is Indifferentiable from an Ideal Cipher.
876
2015
2015
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2015/876
db/journals/iacr/iacr2015.html#Dachman-SoledKT15
Nir Bitansky
Dana Dachman-Soled
Huijia Lin
Leakage-Tolerant Computation with Input-Independent Preprocessing.
146-163
2014
CRYPTO (2)
https://doi.org/10.1007/978-3-662-44381-1_9
conf/crypto/2014-2
db/conf/crypto/crypto2014-2.html#BitanskyDL14
Dana Dachman-Soled
Nils Fleischhacker
Jonathan Katz
Anna Lysyanskaya
Dominique Schröder
Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
405-420
2014
CRYPTO (2)
https://doi.org/10.1007/978-3-662-44381-1_23
conf/crypto/2014-2
db/conf/crypto/crypto2014-2.html#Dachman-SoledFKLS14
Dana Dachman-Soled
A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme.
37-55
2014
Public Key Cryptography
https://doi.org/10.1007/978-3-642-54631-0_3
conf/pkc/2014
db/conf/pkc/pkc2014.html#Dachman-Soled14
Dana Dachman-Soled
Georg Fuchsbauer
Payman Mohassel
Adam O'Neill
Enhanced Chosen-Ciphertext Security and Applications.
329-344
2014
Public Key Cryptography
https://doi.org/10.1007/978-3-642-54631-0_19
conf/pkc/2014
db/conf/pkc/pkc2014.html#Dachman-SoledFMO14
Dana Dachman-Soled
On Minimal Assumptions for Sender-Deniable Public Key Encryption.
574-591
2014
Public Key Cryptography
https://doi.org/10.1007/978-3-642-54631-0_33
conf/pkc/2014
db/conf/pkc/pkc2014.html#Dachman-Soled14a
Dana Dachman-Soled
Mohammad Mahmoody
Tal Malkin
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
217-239
2014
TCC
https://doi.org/10.1007/978-3-642-54242-8_10
conf/tcc/2014
db/conf/tcc/tcc2014.html#Dachman-SoledMM14
Dana Dachman-Soled
Yael Tauman Kalai
Securing Circuits and Protocols against 1/poly(k) Tampering Rate.
540-565
2014
TCC
https://doi.org/10.1007/978-3-642-54242-8_23
conf/tcc/2014
db/conf/tcc/tcc2014.html#Dachman-SoledK14
Dana Dachman-Soled
Vitaly Feldman
Li-Yang Tan
Andrew Wan
Karl Wimmer
Approximate resilience, monotonicity, and the complexity of agnostic learning.
2014
abs/1405.5268
CoRR
http://arxiv.org/abs/1405.5268
db/journals/corr/corr1405.html#Dachman-SoledFTWW14
Dana Dachman-Soled
Feng-Hao Liu
Elaine Shi
Hong-Sheng Zhou
Locally Decodable and Updatable Non-Malleable Codes and Their Applications.
663
2014
2014
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2014/663
db/journals/iacr/iacr2014.html#Dachman-SoledLSZ14a
Dana Dachman-Soled
Feng-Hao Liu
Hong-Sheng Zhou
Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware.
856
2014
2014
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2014/856
db/journals/iacr/iacr2014.html#Dachman-SoledLZ14
Dana Dachman-Soled
Jonathan Katz
Vanishree Rao
Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds.
858
2014
2014
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2014/858
db/journals/iacr/iacr2014.html#Dachman-SoledKR14
Dana Dachman-Soled
Tal Malkin
Mariana Raykova 0001
Muthuramakrishnan Venkitasubramaniam
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments.
316-336
2013
ASIACRYPT (1)
https://doi.org/10.1007/978-3-642-42033-7_17
conf/asiacrypt/2013-1
db/conf/asiacrypt/asiacrypt2013-1.html#Dachman-SoledM0V13
Nir Bitansky
Dana Dachman-Soled
Sanjam Garg
Abhishek Jain 0002
Yael Tauman Kalai
Adriana López-Alt
Daniel Wichs
Why "Fiat-Shamir for Proofs" Lacks a Proof.
182-201
2013
conf/tcc/2013
TCC
https://doi.org/10.1007/978-3-642-36594-2_11
db/conf/tcc/tcc2013.html#BitanskyDG0KLW13
Dana Dachman-Soled
A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware Encryption Scheme.
680
2013
2013
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2013/680
db/journals/iacr/iacr2013.html#Dachman-Soled13
Dana Dachman-Soled
Tal Malkin
Mariana Raykova 0001
Moti Yung
Efficient robust private set intersection.
289-303
2012
2
Int. J. Appl. Cryptogr.
4
https://doi.org/10.1504/IJACT.2012.048080
db/journals/ijact/ijact2.html#Dachman-SoledM0Y12
Dana Dachman-Soled
Yael Tauman Kalai
Securing Circuits against Constant-Rate Tampering.
533-551
2012
CRYPTO
https://doi.org/10.1007/978-3-642-32009-5_31
conf/crypto/2012
db/conf/crypto/crypto2012.html#Dachman-SoledK12
Ran Canetti
Dana Dachman-Soled
Vinod Vaikuntanathan
Hoeteck Wee
Efficient Password Authenticated Key Exchange via Oblivious Transfer.
449-466
2012
Public Key Cryptography
https://doi.org/10.1007/978-3-642-30057-8_27
conf/pkc/2012
db/conf/pkc/pkc2012.html#CanettiDVW12
Seung Geol Choi
Dana Dachman-Soled
Moti Yung
On the Centrality of Off-Line E-Cash to Concrete Partial Information Games.
264-280
2012
SCN
https://doi.org/10.1007/978-3-642-32928-9_15
conf/scn/2012
db/conf/scn/scn2012.html#ChoiDY12
Dana Dachman-Soled
Rosario Gennaro
Hugo Krawczyk
Tal Malkin
Computational Extractors and Pseudorandomness.
383-403
2012
TCC
https://doi.org/10.1007/978-3-642-28914-9_22
conf/tcc/2012
db/conf/tcc/tcc2012.html#Dachman-SoledGKM12
Dana Dachman-Soled
Yael Tauman Kalai
Securing Circuits Against Constant-Rate Tampering.
366
2012
2012
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2012/366
db/journals/iacr/iacr2012.html#Dachman-SoledK12
Dana Dachman-Soled
Georg Fuchsbauer
Payman Mohassel
Adam O'Neill
Enhanced Chosen-Ciphertext Security and Applications.
543
2012
2012
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2012/543
db/journals/iacr/iacr2012.html#Dachman-SoledFMO12
Dana Dachman-Soled
Abhishek Jain 0002
Yael Tauman Kalai
Adriana López-Alt
On the (In)security of the Fiat-Shamir Paradigm, Revisited.
706
2012
2012
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2012/706
db/journals/iacr/iacr2012.html#Dachman-Soled0KL12
Dana Dachman-Soled
On the Impossibility of Sender-Deniable Public Key Encryption.
727
2012
2012
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2012/727
db/journals/iacr/iacr2012.html#Dachman-Soled12
Dana Dachman-Soled
On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks.
Columbia University, USA
2011
https://doi.org/10.7916/D8K64R2W
Dana Dachman-Soled
Tal Malkin
Mariana Raykova 0001
Moti Yung
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications.
130-146
2011
ACNS
https://doi.org/10.1007/978-3-642-21554-4_8
conf/acns/2011
db/conf/acns/acns2011.html#Dachman-SoledMRY11
Dana Dachman-Soled
Rocco A. Servedio
A Canonical Form for Testing Boolean Function Properties.
460-471
2011
APPROX-RANDOM
https://doi.org/10.1007/978-3-642-22935-0_39
conf/approx/2011
db/conf/approx/approx2011.html#Dachman-SoledS11
Dana Dachman-Soled
Yehuda Lindell
Mohammad Mahmoody
Tal Malkin
On the Black-Box Complexity of Optimally-Fair Coin Tossing.
450-467
2011
TCC
https://doi.org/10.1007/978-3-642-19571-6_27
conf/tcc/2011
db/conf/tcc/tcc2011.html#Dachman-SoledLMM11
Dana Dachman-Soled
Tal Malkin
Mariana Raykova 0001
Muthuramakrishnan Venkitasubramaniam
Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability.
611
2011
2011
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2011/611
db/journals/iacr/iacr2011.html#Dachman-SoledMRV11
Dana Dachman-Soled
Rosario Gennaro
Hugo Krawczyk
Tal Malkin
Computational Extractors and Pseudorandomness.
708
2011
2011
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2011/708
db/journals/iacr/iacr2011.html#Dachman-SoledGKM11
Dana Glasner
Rocco A. Servedio
Distribution-Free Testing Lower Bound for Basic Boolean Functions.
191-216
2009
5
Theory Comput.
1
https://doi.org/10.4086/toc.2009.v005a010
db/journals/toc/toc5.html#GlasnerS09
Dana Dachman-Soled
Homin K. Lee
Tal Malkin
Rocco A. Servedio
Andrew Wan
Hoeteck Wee
Optimal Cryptographic Hardness of Learning Monotone Functions.
257-282
2009
5
Theory Comput.
1
https://doi.org/10.4086/toc.2009.v005a013
db/journals/toc/toc5.html#Dachman-SoledLMSWW09
Dana Dachman-Soled
Tal Malkin
Mariana Raykova 0001
Moti Yung
Efficient Robust Private Set Intersection.
125-142
2009
ACNS
https://doi.org/10.1007/978-3-642-01957-9_8
conf/acns/2009
db/conf/acns/acns2009.html#Dachman-SoledMRY09
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.
287-302
2009
ASIACRYPT
https://doi.org/10.1007/978-3-642-10366-7_17
conf/asiacrypt/2009
db/conf/asiacrypt/asiacrypt2009.html#ChoiDMW09
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
Simple, Black-Box Constructions of Adaptively Secure Protocols.
387-402
2009
TCC
https://doi.org/10.1007/978-3-642-00457-5_23
conf/tcc/2009
db/conf/tcc/tcc2009.html#ChoiDMW09
Dana Dachman-Soled
Homin K. Lee
Tal Malkin
Rocco A. Servedio
Andrew Wan
Hoeteck Wee
Optimal Cryptographic Hardness of Learning Monotone Functions.
36-47
2008
ICALP (1)
https://doi.org/10.1007/978-3-540-70575-8_4
conf/icalp/2008-1
db/conf/icalp/icalp2008-1.html#Dachman-SoledLMSWW08
Seung Geol Choi
Dana Dachman-Soled
Tal Malkin
Hoeteck Wee
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
427-444
2008
TCC
https://doi.org/10.1007/978-3-540-78524-8_24
conf/tcc/2008
db/conf/tcc/tcc2008.html#ChoiDMW08
Dana Glasner
Vugranam C. Sreedhar
Configuration Reasoning and Ontology ForWeb.
387-394
2007
conf/IEEEscc/2007
IEEE SCC
https://doi.org/10.1109/SCC.2007.44
https://doi.ieeecomputersociety.org/10.1109/SCC.2007.44
db/conf/IEEEscc/scc2007.html#GlasnerS07
Dana Glasner
Rocco A. Servedio
Distribution-Free Testing Lower Bounds for Basic Boolean Functions.
494-508
2007
conf/approx/2007
APPROX-RANDOM
https://doi.org/10.1007/978-3-540-74208-1_36
db/conf/approx/approx2007.html#GlasnerS07
Sarah Anderson
Daniel Apon
Marshall Ball
Nir Bitansky
Ivan Brugere
Ran Canetti
Mingliang Chen
Chongwon Cho
Seung Geol Choi
Thinh Dang
Michael Davinroy
Danial Dervovic
Léo Ducas
Tudor Dumitras
Michael Fahr
Vitaly Feldman
Nils Fleischhacker
Georg Fuchsbauer
Sanjam Garg
Daniel Genkin
Rosario Gennaro
Eli Goldin
Huijing Gong
S. Dov Gordon
Siyao Guo
Tom Hanson
Sanghyun Hong 0001
Abhishek Jain 0002
Stanislaw Jarecki
Yael Tauman Kalai
Jonathan Katz
Yigitcan Kaya
John Kelsey
Hunter Kippen
Ilan Komargodski
Hugo Krawczyk
Kevin Kulda
Mukul Kulkarni
Andrew Kwong
Kristin E. Lauter
Zachary McBride Lazri
Homin K. Lee
Mingyu Liang
Jacob Lichtinger
Huijia Lin
Yehuda Lindell
Chang Liu 0021
Feng-Hao Liu
Linsheng Liu
Yuntao Liu 0001
Stuart Nevans Locke
Adriana López-Alt
Julian Loss
Anna Lysyanskaya
Mohammad Mahmoody
Tal Malkin
Sweta Mishra
Payman Mohassel
Saachi Mutreja
Alexander Nelson
Ben San Nicolas
Adam O'Neill
Charalampos Papamanthou
Angela Park
Se Yong Park
Rafael Pass
Ray A. Perlner
Antigoni Polychroniadou
Ian Rackow
Vanishree Rao
Mariana Raykova 0001
Melissa RossiMélissa Rossi
Dominique Schröder
Rocco A. Servedio
Aria Shahverdi
Elaine Shi
Mahammad Shirinov
Nikki Sigurdson
Vugranam C. Sreedhar
Ankur Srivastava 0001
Li-Yang Tan
Aishwarya Thiruvengadam
Xin Tian
Meltem Sönmez Turan
Vinod Vaikuntanathan
Muthuramakrishnan Venkitasubramaniam
Uzi Vishkin
Andrew Wan
Hoeteck Wee
Daniel Wichs
Karl Wimmer
Min Wu 0001
Arkady Yerukhimovich
Moti Yung
Justin Zhang 0004
Hong-Sheng Zhou
Yvonne Zhou