Arithmetic sketching

DOI10.1007/978-3-031-38557-5_6MaRDI QIDQ6186591

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

Publication date: 2 February 2024

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local decision test for sparse polynomials
• The communication complexity of addition
• An information statistics approach to data stream and communication complexity
• Private multiparty sampling and approximation of vector combinations
• The hunting of the SNARK
• Compact zero-knowledge proofs of small Hamming weight
• Function secret sharing for mixed-mode and fixed-point secure computation
• Lightweight, maliciously secure verifiable function secret sharing
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Targeted malleability
• Secure multiparty computation of approximations
• Function Secret Sharing
• Non-interactive Zero-Knowledge Arguments for Voting
• Newton's Identities
• The Probabilistic Communication Complexity of Set Intersection
• An improved data stream summary: the count-min sketch and its applications
• Circuits resilient to additive attacks with applications to secure computation
• Tight Lower Bound for Linear Sketches of Moments
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Theory of Cryptography

This page was built for publication: Arithmetic sketching