Alexander R. Block

According to our database, Alexander R. Block authored at least 18 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

SNARK Lower Bounds via Communication Complexity.

Rishabh Bhadauria, Alexander R. Block, Prantar Ghosh, Justin Thaler

IACR Cryptol. ePrint Arch., 2025

2024

On the Concrete Security of Non-interactive FRI.

Alexander R. Block, Pratyush Ranjan Tiwari

Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Field-Agnostic SNARKs from Expand-Accumulate Codes.

Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

On Soundness Notions for Interactive Oracle Proofs.

Alexander R. Block, Albert Garreta, Pratyush Ranjan Tiwari, Michal Zajac

IACR Cryptol. ePrint Arch., 2023

Computationally Relaxed Locally Decodable Codes, Revisited.

Alexander R. Block, Jeremiah Blocki

Proceedings of the IEEE International Symposium on Information Theory, 2023

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors.

Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu

Proceedings of the 38th Computational Complexity Conference, 2023

Fiat-Shamir Security of FRI and Related SNARKs.

Alexander R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022

Honest Majority Multi-Prover Interactive Arguments.

Alexander R. Block, Christina Garman

IACR Cryptol. ePrint Arch., 2022

Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes.

Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

2021

Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions.

Alexander R. Block, Jeremiah Blocki

Proceedings of the IEEE International Symposium on Information Theory, 2021

Time- and Space-Efficient Arguments from Groups of Unknown Order.

Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

P₄-free Partition and Cover Numbers & Applications.

Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi K. Mehta, Tamalika Mukherjee, Hai H. Nguyen

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020

P₄-free Partition and Cover Numbers.

Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi K. Mehta, Tamalika Mukherjee, Hai H. Nguyen

IACR Cryptol. ePrint Arch., 2020

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.

Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Locally Decodable/Correctable Codes for Insertions and Deletions.

Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2018

Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions).

Alexander R. Block, Divya Gupta, Hemanta K. Maji, Hai H. Nguyen

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Secure Computation with Constant Communication Overhead Using Multiplication Embeddings.

Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen

Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017

Secure Computation Based on Leaky Correlations: High Resilience Setting.

Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017