Arithmetic Cryptography
From MaRDI portal
Publication:2989025
DOI10.1145/2688073.2688114zbMath1364.94522OpenAlexW2032842968MaRDI QIDQ2989025
Benny Applebaum, Christina Brzuska, Jonathan Avron
Publication date: 19 May 2017
Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2688073.2688114
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)
Related Items (7)
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ New ways to garble arithmetic circuits ⋮ Indistinguishability obfuscation ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for publication: Arithmetic Cryptography
