Arithmetic sketching
DOI10.1007/978-3-031-38557-5_6MaRDI QIDQ6186591FDOQ6186591
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)
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- An improved data stream summary: the count-min sketch and its applications
- On the exact space complexity of sketching and streaming small norms
- The Probabilistic Communication Complexity of Set Intersection
- An information statistics approach to data stream and communication complexity
- Newton's Identities
- A local decision test for sparse polynomials
- Secure multiparty computation of approximations
- Title not available (Why is that?)
- The communication complexity of addition
- Circuits resilient to additive attacks with applications to secure computation
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Non-interactive Zero-Knowledge Arguments for Voting
- Title not available (Why is that?)
- Theory of Cryptography
- Private multiparty sampling and approximation of vector combinations
- Compact zero-knowledge proofs of small Hamming weight
- Function secret sharing
- Targeted malleability: homomorphic encryption for restricted computations
- The hunting of the SNARK
- Function secret sharing for mixed-mode and fixed-point secure computation
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Lightweight, maliciously secure verifiable function secret sharing
- Tight lower bound for linear sketches of moments
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)