How to recover a secret with \(O(n)\) additions
From MaRDI portal
Publication:6186593
DOI10.1007/978-3-031-38557-5_8OpenAlexW4385654309MaRDI QIDQ6186593
Oded Nir, Benny Applebaum, Benny Pinkas
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_8
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linear-size pseudorandom generators and hardcore functions
- Fast modular transforms
- Secret sharing over infinite domains
- Threshold cryptosystems from threshold fully homomorphic encryption
- Short signatures from the Weil pairing
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Arithmetic Circuits: A survey of recent results and open questions
- A Sample of Samplers: A Computational Perspective on Sampling
- Modern Coding Theory
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Randomness conductors and constant-degree lossless expanders
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Founding Cryptography on Oblivious Transfer – Efficiently
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- On the Evaluation of Powers and Monomials
- Efficient erasure correcting codes
- Capacity-achieving sequences for the erasure channel
- Universally ideal secret-sharing schemes
- Distributed fingerprints and secure information dispersal
- Secure Computation from Random Error Correcting Codes
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Linear Threshold Secret-Sharing with Binary Reconstruction
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
