متابعة
Alexander R. Block
Alexander R. Block
Department of Computer Science, University of Illinois at Chicago
بريد إلكتروني تم التحقق منه على uic.edu - الصفحة الرئيسية
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
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‏
792021
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‏
382020
Secure computation with constant communication overhead using multiplication embeddings‏
AR Block, HK Maji, HH Nguyen‏
International Conference on Cryptology in India, 375-398, 2018‏
222018
Secure computation based on leaky correlations: High resilience setting‏
AR Block, HK Maji, HH Nguyen‏
Annual International Cryptology Conference, 3-32, 2017‏
222017
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‏
192023
Locally Decodable/Correctable Codes for Insertions and Deletions‏
AR Block, J Blocki, E Grigorescu, S Kulkarni, M Zhu‏
arXiv preprint arXiv:2010.11989, 2020‏
122020
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‏
102021
Secure computation using leaky correlations (asymptotically optimal constructions)‏
AR Block, D Gupta, HK Maji, HH Nguyen‏
Theory of Cryptography Conference, 36-65, 2018‏
92018
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‏
82022
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors‏
A Block, J Blocki, K Cheng, E Grigorescu, X Li, Y Zheng, M Zhu‏
arXiv preprint arXiv:2209.08688, 2022‏
62022
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‏
62021
On soundness notions for interactive oracle proofs‏
AR Block, A Garreta, PR Tiwari, M Zając‏
Journal of Cryptology 38 (1), 4, 2025‏
52025
On the Concrete Security of Non-interactive FRI‏
AR Block, PR Tiwari‏
International Conference on Security and Cryptography for Networks, 275-296, 2024‏
32024
Honest Majority Multi-Prover Interactive Arguments‏
AR Block, C Garman‏
Cryptology ePrint Archive, 2022‏
32022
Field-Agnostic SNARKs from Expand-Accumulate Codes‏
AR Block, Z Fang, J Katz, J Thaler, H Waldner, Y Zhang‏
Annual International Cryptology Conference, 276-307, 2024‏
22024
Computationally relaxed locally decodable codes, revisited‏
AR Block, J Blocki‏
2023 IEEE International Symposium on Information Theory (ISIT), 2714-2719, 2023‏
12023
Combined Games‏
A Block, B Huang‏
12014
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
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‏
2021
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20