default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander R. Block
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j1]Alexander R. Block, Albert Garreta, Pratyush Ranjan Tiwari, Michal Zajac:
On Soundness Notions for Interactive Oracle Proofs. J. Cryptol. 38(1): 4 (2025)- 2024
- [c14]Alexander R. Block
, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang:
Field-Agnostic SNARKs from Expand-Accumulate Codes. CRYPTO (10) 2024: 276-307 - [c13]Alexander R. Block, Pratyush Ranjan Tiwari:
On the Concrete Security of Non-interactive FRI. SCN (1) 2024: 275-296 - [i15]Alexander R. Block, Pratyush Ranjan Tiwari:
On the Concrete Security of Non-interactive FRI. IACR Cryptol. ePrint Arch. 2024: 1161 (2024) - [i14]Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang:
Field-Agnostic SNARKs from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2024: 1871 (2024) - 2023
- [c12]Alexander R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac:
Fiat-Shamir Security of FRI and Related SNARKs. ASIACRYPT (2) 2023: 3-40 - [c11]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CCC 2023: 14:1-14:25 - [c10]Alexander R. Block, Jeremiah Blocki:
Computationally Relaxed Locally Decodable Codes, Revisited. ISIT 2023: 2714-2719 - [i13]Alexander R. Block, Jeremiah Blocki:
Computationally Relaxed Locally Decodable Codes, Revisited. CoRR abs/2305.01083 (2023) - [i12]Alexander R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac:
Fiat-Shamir Security of FRI and Related SNARKs. IACR Cryptol. ePrint Arch. 2023: 1071 (2023) - [i11]Alexander R. Block, Albert Garreta, Pratyush Ranjan Tiwari, Michal Zajac:
On Soundness Notions for Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2023: 1256 (2023) - 2022
- [c9]Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki:
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. SCN 2022: 45-68 - [i10]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CoRR abs/2209.08688 (2022) - [i9]Alexander R. Block, Christina Garman:
Honest Majority Multi-Prover Interactive Arguments. IACR Cryptol. ePrint Arch. 2022: 557 (2022) - 2021
- [c8]Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi K. Mehta, Tamalika Mukherjee, Hai H. Nguyen:
P4-free Partition and Cover Numbers & Applications. ITC 2021: 16:1-16:25 - [c7]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Time- and Space-Efficient Arguments from Groups of Unknown Order. CRYPTO (4) 2021: 123-152 - [c6]Alexander R. Block, Jeremiah Blocki:
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. ISIT 2021: 1841-1846 - [i8]Alexander R. Block, Jeremiah Blocki:
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. CoRR abs/2103.14122 (2021) - [i7]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Time- and Space-Efficient Arguments from Groups of Unknown Order. IACR Cryptol. ePrint Arch. 2021: 358 (2021) - [i6]Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki:
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. IACR Cryptol. ePrint Arch. 2021: 801 (2021) - 2020
- [c5]Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. FSTTCS 2020: 16:1-16:17 - [c4]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. TCC (2) 2020: 168-197 - [i5]Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. CoRR abs/2010.11989 (2020) - [i4]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. IACR Cryptol. ePrint Arch. 2020: 1425 (2020) - [i3]Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi K. Mehta, Tamalika Mukherjee, Hai H. Nguyen:
P4-free Partition and Cover Numbers. IACR Cryptol. ePrint Arch. 2020: 1605 (2020)
2010 – 2019
- 2018
- [c3]Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen:
Secure Computation with Constant Communication Overhead Using Multiplication Embeddings. INDOCRYPT 2018: 375-398 - [c2]Alexander R. Block, Divya Gupta, Hemanta K. Maji, Hai H. Nguyen:
Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions). TCC (2) 2018: 36-65 - [i2]Alexander R. Block, Divya Gupta, Hemanta K. Maji, Hai H. Nguyen:
Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions). IACR Cryptol. ePrint Arch. 2018: 372 (2018) - [i1]Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen:
Secure Computation with Constant Communication Overhead using Multiplication Embeddings. IACR Cryptol. ePrint Arch. 2018: 395 (2018) - 2017
- [c1]Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen:
Secure Computation Based on Leaky Correlations: High Resilience Setting. CRYPTO (2) 2017: 3-32
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 2024-12-12 21:00 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:
