Arithmetic cryptography (extended abstract)

DOI10.1145/2688073.2688114MaRDI QIDQ2989025zbMATH OpenOpenAlexWikidataFDO

Authors Benny Applebaum, Jonathan Avron, Christina Brzuska

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

zbMATH Keywords

arithmetic circuitscomputational complexitycryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Arithmetic cryptography
• scientific article; zbMATH DE number 2086704
• Secure Arithmetic Computation with No Honest Majority
• How to garble arithmetic circuits
• Arithmetic garbling from bilinear maps

Cited in

(20)

• 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\)
• Description of (fully) homomorphic cryptographic primitives within the \(p\)-adic model of encryption
• Aryabhata remainder theorem: relevance to public-key crypto-algorithms
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
• Linicrypt: a model for practical cryptography
• CLAUDE COMIERS: THE FIRST ARITHMETICAL CRYPTOGRAPHY
• scientific article; zbMATH DE number 7014242 (Why is no real title available?)
• Arithmetic cryptography
• Arithmetic operations on encrypted data
• Computational Cryptography
• Garbled circuits as randomized encodings of functions: a primer
• scientific article; zbMATH DE number 5066607 (Why is no real title available?)
• Cryptography and Coding
• New ways to garble arithmetic circuits
• An Idempotent Cryptarithm
• Indistinguishability obfuscation
• Lower bounds for lattice-based compact functional encryption
• Indistinguishability obfuscation from well-founded assumptions

This page was built for publication: Arithmetic cryptography (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989025)