Alexander R. Block

Orcid: 0000-0002-2632-763X

According to our database1, Alexander R. Block authored at least 15 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On Soundness Notions for Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch., 2023

Fiat-Shamir Security of FRI and Related SNARKs.
IACR Cryptol. ePrint Arch., 2023

Computationally Relaxed Locally Decodable Codes, Revisited.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Honest Majority Multi-Prover Interactive Arguments.
IACR Cryptol. ePrint Arch., 2022

2021
Time- and Space-Efficient Arguments from Groups of Unknown Order.
IACR Cryptol. ePrint Arch., 2021

Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes.
IACR Cryptol. ePrint Arch., 2021

Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

P<sub>4</sub>-free Partition and Cover Numbers & Applications.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
IACR Cryptol. ePrint Arch., 2020

P<sub>4</sub>-free Partition and Cover Numbers.
IACR Cryptol. ePrint Arch., 2020

Locally Decodable/Correctable Codes for Insertions and Deletions.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2018
Secure Computation with Constant Communication Overhead using Multiplication Embeddings.
IACR Cryptol. ePrint Arch., 2018

Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions).
IACR Cryptol. ePrint Arch., 2018

2017
Secure Computation Based on Leaky Correlations: High Resilience Setting.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017


  Loading...