Arithmetic sketching

DOI10.1007/978-3-031-38557-5_6MaRDI QIDQ6186591zbMATH OpenFDO

Authors Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38557-5_6

zbMATH Keywords

lightweight protocolslow-communication zero-knowledge verification of secret-shared vectors

Mathematics Subject Classification ID

Database theory (68P15) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Secure arithmetic computation with constant computational overhead
• Secure Arithmetic Computation with No Honest Majority
• Zero-knowledge proofs from secure multiparty computation
• Sketching in Adversarial Environments

Cites work

• A local decision test for sparse polynomials
• An improved data stream summary: the count-min sketch and its applications
• An information statistics approach to data stream and communication complexity
• Circuits resilient to additive attacks with applications to secure computation
• Compact zero-knowledge proofs of small Hamming weight
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Function secret sharing
• Function secret sharing for mixed-mode and fixed-point secure computation
• scientific article; zbMATH DE number 177818 (Why is no real title available?)
• scientific article; zbMATH DE number 1256715 (Why is no real title available?)
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• Lightweight, maliciously secure verifiable function secret sharing
• Newton's Identities
• Non-interactive Zero-Knowledge Arguments for Voting
• On the exact space complexity of sketching and streaming small norms
• Private multiparty sampling and approximation of vector combinations
• Secure multiparty computation of approximations
• Targeted malleability: homomorphic encryption for restricted computations
• The communication complexity of addition
• The hunting of the SNARK
• The Probabilistic Communication Complexity of Set Intersection
• Theory of Cryptography
• Tight lower bound for linear sketches of moments
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(1)

• Polynomial secret sharing schemes and algebraic matroids

This page was built for publication: Arithmetic sketching

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