default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarshall Ball
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos:
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. CRYPTO (2) 2024: 113-146- [c27]Marshall Ball
, Ronen Shaltiel, Jad Silbak:
Non-malleable Codes with Optimal Rate for Poly-Size Circuits. EUROCRYPT (4) 2024: 33-54 - [i41]Marshall Ball, James Bell-Clark, Adrià Gascón, Peter Kairouz, Sewoong Oh, Zhiye Xie:
Secure Stateful Aggregation: A Practical Protocol with Applications in Differentially-Private Federated Learning. CoRR abs/2410.11368 (2024) - [i40]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. TR24 (2024) - [i39]Marshall Ball, Ronen Shaltiel, Jad Silbak:
Extractors for Samplable Distributions with Low Min-Entropy. Electron. Colloquium Comput. Complex. TR24 (2024) - [i38]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024: 425 (2024) - [i37]Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos:
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. IACR Cryptol. ePrint Arch. 2024: 637 (2024) - [i36]Marshall Ball, James Bell-Clark, Adrià Gascón, Peter Kairouz, Sewoong Oh, Zhiye Xie:
Secure Stateful Aggregation: A Practical Protocol with Applications in Differentially-Private Federated Learning. IACR Cryptol. ePrint Arch. 2024: 1655 (2024) - 2023
- [j2]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36(4): 39 (2023) - [c26]Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu:
New Ways to Garble Arithmetic Circuits. EUROCRYPT (2) 2023: 3-34 - [c25]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS 2023: 458-483 - [c24]Marshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja:
Extracting Randomness from Samplable Distributions, Revisited. FOCS 2023: 1505-1514 - [c23]Marshall Ball, Yevgeniy Dodis, Eli Goldin:
Immunizing Backdoored PRGs. TCC (3) 2023: 153-182 - [c22]Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. TCC (1) 2023: 349-379 - [i35]Marshall Ball, Dana Dachman-Soled:
(Inefficient Prover) ZAPs from Hard-to-Invert Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i34]Marshall Ball, Dana Dachman-Soled, Eli Goldin, Saachi Mutreja:
Extracting Randomness from Samplable Distributions, Revisited. Electron. Colloquium Comput. Complex. TR23 (2023) - [i33]Marshall Ball, Ronen Shaltiel, Jad Silbak:
Non-malleable codes with optimal rate for poly-size circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i32]Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu:
New Ways to Garble Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2023: 501 (2023) - [i31]Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2023: 849 (2023) - [i30]Marshall Ball, Yevgeniy Dodis, Eli Goldin:
Immunizing Backdoored PRGs. IACR Cryptol. ePrint Arch. 2023: 1778 (2023) - 2022
- [j1]Divesh Aggarwal, Marshall Ball, Maciej Obremski:
Non-Malleable Code in the Split-State Model. Entropy 24(8): 1038 (2022) - [c21]Marshall Ball, Tim Randolph:
A Note on the Complexity of Private Simultaneous Messages with Many Parties. ITC 2022: 7:1-7:12 - [c20]Marshall Ball, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-malleability. CRYPTO (1) 2022: 148-177 - [c19]Marshall Ball, Oded Goldreich, Tal Malkin:
Randomness Extraction from Somewhat Dependent Sources. ITCS 2022: 12:1-12:14 - [i29]Sunil Pai, Taewon Park, Marshall Ball, Bogdan Penkovsky, Maziyar Milanizadeh, Michael Dubrovsky, Nathnael Abebe, Francesco Morichetti, Andrea Melloni, Shanhui Fan, Olav Solgaard, David A. B. Miller:
Experimental evaluation of digitally-verifiable photonic computing for blockchain and cryptocurrency. CoRR abs/2205.08512 (2022) - [i28]Marshall Ball, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-Malleability. Electron. Colloquium Comput. Complex. TR22 (2022) - [i27]Marshall Ball, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-Malleability. IACR Cryptol. ePrint Arch. 2022: 70 (2022) - [i26]Divesh Aggarwal, Marshall Ball, Maciej Obremski:
Survey: Non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2022: 1326 (2022) - 2021
- [b1]Marshall Ball:
On Resilience to Computable Tampering. Columbia University, USA, 2021 - [c18]Marshall Ball, Alper Çakan, Tal Malkin:
Linear Threshold Secret-Sharing with Binary Reconstruction. ITC 2021: 12:1-12:22 - [c17]Marshall Ball, Oded Goldreich, Tal Malkin:
Communication Complexity with Defective Randomness. CCC 2021: 14:1-14:10 - [i25]Marshall Ball, Alper Çakan, Tal Malkin:
Linear Threshold Secret-Sharing with Binary Reconstruction. Electron. Colloquium Comput. Complex. TR21 (2021) - [i24]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021: 388 (2021) - 2020
- [c16]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-malleability Against Polynomial Tampering. CRYPTO (3) 2020: 97-126 - [c15]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni:
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. CRYPTO (3) 2020: 674-703 - [c14]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. ITCS 2020: 80:1-80:32 - [c13]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27 - [c12]Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin:
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? ITCS 2020: 86:1-86:22 - [c11]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. TCC (2) 2020: 473-501 - [i23]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. TR20 (2020) - [i22]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. TR20 (2020) - [i21]Marshall Ball, Oded Goldreich, Tal Malkin:
Communication Complexity with Defective Randomness. Electron. Colloquium Comput. Complex. TR20 (2020) - [i20]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020: 147 (2020) - [i19]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020: 395 (2020)
2010 – 2019
- 2019
- [c10]Marshall Ball, Siyao Guo, Daniel Wichs:
Non-malleable Codes for Decision Trees. CRYPTO (1) 2019: 413-434 - [c9]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. EUROCRYPT (1) 2019: 501-530 - [c8]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) 2019: 502-530 - [i18]Michael Dubrovsky, Marshall Ball, Bogdan Penkovsky:
Optical Proof of Work. CoRR abs/1911.05193 (2019) - [i17]Marshall Ball, Oded Goldreich, Tal Malkin:
Randomness Extraction from Somewhat Dependent Sources. Electron. Colloquium Comput. Complex. TR19 (2019) - [i16]Marshall Ball, Brent Carmer, Tal Malkin, Mike Rosulek, Nichole Schimanski:
Garbled Neural Networks are Practical. IACR Cryptol. ePrint Arch. 2019: 338 (2019) - [i15]Marshall Ball, Siyao Guo, Daniel Wichs:
Non-Malleable Codes for Decision Trees. IACR Cryptol. ePrint Arch. 2019: 379 (2019) - [i14]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. IACR Cryptol. ePrint Arch. 2019: 449 (2019) - [i13]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019: 1094 (2019) - [i12]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni:
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction. IACR Cryptol. ePrint Arch. 2019: 1464 (2019) - 2018
- [c7]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Work From Worst-Case Assumptions. CRYPTO (1) 2018: 789-819 - [c6]Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran:
Exploring the Boundaries of Topology-Hiding Computation. EUROCRYPT (3) 2018: 294-325 - [c5]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. EUROCRYPT (3) 2018: 618-650 - [c4]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. FOCS 2018: 826-837 - [i11]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. CoRR abs/1802.07673 (2018) - [i10]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i9]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. 2018: 207 (2018) - [i8]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Work from Worst-Case Assumptions. IACR Cryptol. ePrint Arch. 2018: 559 (2018) - [i7]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. IACR Cryptol. ePrint Arch. 2018: 1015 (2018) - 2017
- [c3]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-case fine-grained hardness. STOC 2017: 483-496 - [i6]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-Case Fine-Grained Hardness. Electron. Colloquium Comput. Complex. TR17 (2017) - [i5]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-Case Fine-Grained Hardness. IACR Cryptol. ePrint Arch. 2017: 202 (2017) - [i4]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Useful Work. IACR Cryptol. ePrint Arch. 2017: 203 (2017) - [i3]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering. IACR Cryptol. ePrint Arch. 2017: 1061 (2017) - 2016
- [c2]Marshall Ball, Tal Malkin, Mike Rosulek:
Garbling Gadgets for Boolean and Arithmetic Circuits. CCS 2016: 565-577 - [c1]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. EUROCRYPT (2) 2016: 881-908 - [i2]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. IACR Cryptol. ePrint Arch. 2016: 307 (2016) - [i1]Marshall Ball, Tal Malkin, Mike Rosulek:
Garbling Gadgets for Boolean and Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2016: 969 (2016)
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 2025-01-09 13:27 CET 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:
