Výsledky vyhledávání - "Alexander R. Block"

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

Autor: Alexander R. Block, Jeremiah Blocki

Publikováno v: ISIT

We construct locally decodable codes (LDCs) to correct insertion-deletion errors in the setting where the sender and receiver share a secret key or where the channel is resource-bounded. Our constructions rely on a so-called "Hamming-to-InsDel" compi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af5ddb0a869d54bdce8ad9fdbcd8f95e

Zobrazit plný text záznamu

Time- and space-efficient arguments from groups of unknown order

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

Publikováno v: Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2021
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)
Advances in Cryptology – CRYPTO 2021-41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV

We construct public-coin time- and space-efficient zero-knowledge arguments for \(\mathbf {NP} \). For every time T and space S non-deterministic RAM computation, the prover runs in time \(T \cdot {{\,\mathrm{polylog}\,}}(T)\) and space \(S \cdot {{\

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a935249ac1a60ec5346226d994571ad1
https://hdl.handle.net/11565/4053343

Zobrazit plný text záznamu

Public-coin zero-knowledge arguments with (almost) minimal time and space overheads

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

Publikováno v: Theory of Cryptography-18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Theory of Cryptography
Theory of Cryptography ISBN: 9783030643775
TCC (2)

Zero-knowledge protocols enable the truth of a mathematical statement to be certified by a verifier without revealing any other information. Such protocols are a cornerstone of modern cryptography and recently are becoming more and more practical. Ho

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e18649c92a0c44fbec9a4d8c21d5fa0f
https://hdl.handle.net/11565/4053337

Zobrazit plný text záznamu

Secure Computation with Constant Communication Overhead Using Multiplication Embeddings

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

Publikováno v: Progress in Cryptology – INDOCRYPT 2018 ISBN: 9783030053772
INDOCRYPT

Secure multi-party computation (MPC) allows mutually distrusting parties to compute securely over their private data. The hardness of MPC, essentially, lies in performing secure multiplications over suitable algebras.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0edd94122dfe73e7a56fe480665bf0f8
https://doi.org/10.1007/978-3-030-05378-9_20

Zobrazit plný text záznamu

Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions)

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

Publikováno v: Theory of Cryptography ISBN: 9783030038090
TCC (2)

Most secure computation protocols can be effortlessly adapted to offload a significant fraction of their computationally and cryptographically expensive components to an offline phase so that the parties can run a fast online phase and perform their

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::144e56df430a95f02e81130d6897722b
https://doi.org/10.1007/978-3-030-03810-6_2

Zobrazit plný text záznamu

Secure Computation Based on Leaky Correlations: High Resilience Setting

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

Publikováno v: Advances in Cryptology – CRYPTO 2017 ISBN: 9783319637143
CRYPTO (2)

Correlated private randomness, or correlation in short, is a fundamental cryptographic resource that helps parties compute securely over their private data. An offline preprocessing step, which is independent of the eventual secure computation, gener

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::041cc77bdffd4d5f47774c860ee5b1df
https://doi.org/10.1007/978-3-319-63715-0_1

Zobrazit plný text záznamu

Dissertation/ Thesis

Exploring the Composition of Coding Theory and Cryptography through Secure Computation, Succinct Arguments, and Local Codes

Autor: Alexander R Block (13154601)

We examine new ways in which coding theory and cryptography continue to be composed together, and show that the composition of these two fields yield new constructions in the areas of Secure Computation Protocols, Succinct Interactive Arguments, and

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání