Limits on the efficiency of (ring) LWE-based non-interactive key exchange

Autor: Siyao Guo, Pritish Kamath, Katerina Sotiraki, Alon Rosen

$$\mathsf {LWE}$$ -based key-exchange protocols lie at the heart of post-quantum public-key cryptography. However, all existing protocols either lack the non-interactive nature of Diffie–Hellman key exchange or polynomial $$\mathsf {LWE}$$ -modulus

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a81cc65b91565f0a293f26185ee1c39
http://hdl.handle.net/11565/4045463

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

An algebraic approach to Nonmalleability

Autor: Alon Rosen, Margarita Vald, Silas Richelson, Vipul Goyal

In their seminal work on nonmalleable cryptography, Dolev, Dwork, and Naor showed how to construct a nonmalleable commitment with logarithmically-many “rounds''/``slots,” the idea being that any ad...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97b00f60cc07b17c62932c0d824dece7
http://hdl.handle.net/11565/4043094

Cryptography from One-Way Communication: On Completeness of Finite Channels

Autor: Varun Narayanan, Eyal Kushilevitz, Vinod M. Prabhakaran, Shweta Agrawal, Manoj Prabhakaran, Alon Rosen, Yuval Ishai

Publikováno v: Advances in Cryptology – ASIACRYPT 2020 ISBN: 9783030648398
ASIACRYPT (3)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2020
Advances in Cryptology – ASIACRYPT 2020-26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7–11, 2020, Proceedings, Part III

Garg et al. (Crypto 2015) initiated the study of cryptographic protocols over noisy channels in the non-interactive setting, namely when only one party speaks. A major question left open by this work is the completeness of finite channels, whose inpu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05f3604420d3f24ee6d7afed23d35f52
https://doi.org/10.1007/978-3-030-64840-4_22

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir

Autor: Arka Rai Choudhuri, Pavel Hubáček, Guy N. Rothblum, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen

Publikováno v: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing-STOC 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
STOC

The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s transcript. Constructing hash functions for which t

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