Follow
Alexander R. Block
Alexander R. Block
Department of Computer Science, University of Maryland and Georgetown University
Verified email at georgetown.edu - Homepage
Title
Cited by
Cited by
Year
Time-and space-efficient arguments from groups of unknown order
AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
612021
Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Theory of Cryptography Conference, 168-197, 2020
262020
Secure computation based on leaky correlations: High resilience setting
AR Block, HK Maji, HH Nguyen
Annual International Cryptology Conference, 3-32, 2017
202017
Secure computation with constant communication overhead using multiplication embeddings
AR Block, HK Maji, HH Nguyen
International Conference on Cryptology in India, 375-398, 2018
182018
Locally Decodable/Correctable Codes for Insertions and Deletions
AR Block, J Blocki, E Grigorescu, S Kulkarni, M Zhu
arXiv preprint arXiv:2010.11989, 2020
112020
Fiat-Shamir security of FRI and related snarks
AR Block, A Garreta, J Katz, J Thaler, PR Tiwari, M Zając
International Conference on the Theory and Application of Cryptology and …, 2023
82023
Private and resource-bounded locally decodable codes for insertions and deletions
AR Block, J Blocki
2021 IEEE International Symposium on Information Theory (ISIT), 1841-1846, 2021
82021
Secure computation using leaky correlations (asymptotically optimal constructions)
AR Block, D Gupta, HK Maji, HH Nguyen
Theory of Cryptography Conference, 36-65, 2018
62018
Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
MH Ameri, AR Block, J Blocki
International Conference on Security and Cryptography for Networks, 45-68, 2022
32022
P4-free Partition and Cover Numbers & Applications
AR Block, S Brânzei, HK Maji, H Mehta, T Mukherjee, HH Nguyen
2nd Conference on Information-Theoretic Cryptography, 2021
32021
Honest Majority Multi-Prover Interactive Arguments
AR Block, C Garman
Cryptology ePrint Archive, 2022
22022
Computationally relaxed locally decodable codes, revisited
AR Block, J Blocki
2023 IEEE International Symposium on Information Theory (ISIT), 2714-2719, 2023
12023
On Soundness Notions for Interactive Oracle Proofs
AR Block, A Garreta, PR Tiwari, M Zając
Cryptology ePrint Archive, 2023
12023
P₄-free Partition and Cover Numbers & Applications
AR Block, S Brânzei, HK Maji, H Mehta, T Mukherjee, HH Nguyen
2nd Conference on Information-Theoretic Cryptography (ITC 2021), 2021
12021
Combined Games
A Block, B Huang
12014
Leibniz International Proceedings in Informatics (LIPIcs): 38th Computational Complexity Conference (CCC 2023)
AR Block, J Blocki, K Cheng, E Grigorescu, X Li, Y Zheng, M Zhu
38th Computational Complexity Conference (CCC 2023), 2023
2023
Exploring the Composition of Coding Theory and Cryptography through Secure Computation, Succinct Arguments, and Local Codes
AR Block
Purdue University, 2022
2022
Time-and space-efficient arguments from groups of unknown order. LNCS
AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Springer, 2021
2021
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
P Soni
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–19