How to recover a secret with O(n) additions
DOI10.1007/978-3-031-38557-5_8OpenAlexW4385654309MaRDI QIDQ6186593FDOQ6186593
Authors: Benny Applebaum, Oded Nir, 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
Recommendations
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Linear Threshold Secret-Sharing with Binary Reconstruction
- scientific article; zbMATH DE number 1942426
- Secret Sharing With Public Reconstruction
- scientific article; zbMATH DE number 1031004
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) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cites Work
- Fast modular transforms
- Short signatures from the Weil pairing
- How to share a secret
- Title not available (Why is that?)
- On the Evaluation of Powers and Monomials
- Title not available (Why is that?)
- Secure Computation from Random Error Correcting Codes
- Secret sharing over infinite domains
- Secret-Sharing Schemes: A Survey
- Title not available (Why is that?)
- Founding Cryptography on Oblivious Transfer – Efficiently
- Universally ideal secret-sharing schemes
- A sample of samplers: a computational perspective on sampling
- Arithmetic circuits: a survey of recent results and open questions
- Practical threshold signatures
- Cryptography with constant computational overhead
- Randomness conductors and constant-degree lossless expanders
- Modern Coding Theory
- Efficient erasure correcting codes
- Title not available (Why is that?)
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Title not available (Why is that?)
- On linear-size pseudorandom generators and hardcore functions
- Distributed fingerprints and secure information dispersal
- Threshold cryptosystems from threshold fully homomorphic encryption
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Capacity-achieving sequences for the erasure channel
- 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)
Cited In (1)
This page was built for publication: How to recover a secret with \(O(n)\) additions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186593)
