Arithmetic cryptography

DOI10.1145/3046675MaRDI QIDQ4640283zbMATH OpenOpenAlexWikidataFDO

Authors Benny Applebaum, Jonathan Avron, Chris Brzuska

Publication date 17 May 2018

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3046675

zbMATH Keywords

cryptographysecure computationlearning with noisearithmetic complexity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Arithmetic cryptography (extended abstract)
• 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

(9)

• Description of (fully) homomorphic cryptographic primitives within the \(p\)-adic model of encryption
• Arithmetic cryptography (extended abstract)
• Secure arithmetic computation with constant computational overhead
• CLAUDE COMIERS: THE FIRST ARITHMETICAL CRYPTOGRAPHY
• Linicrypt: a model for practical cryptography
• How to garble arithmetic circuits
• Actively secure arithmetic computation and VOLE with constant computational overhead
• Arithmetic operations on encrypted data
• An Idempotent Cryptarithm

This page was built for publication: Arithmetic cryptography

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