How to recover a secret with O(n) additions

DOI10.1007/978-3-031-38557-5_8MaRDI QIDQ6186593zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

secret sharingthreshold cryptographyblackbox secret sharing

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1942426 (Why is no real title available?)
• scientific article; zbMATH DE number 1559530 (Why is no real title available?)
• A sample of samplers: a computational perspective on sampling
• Arithmetic circuits: a survey of recent results and open questions
• Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
• Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
• Capacity-achieving sequences for the erasure channel
• Cryptography with constant computational overhead
• Distributed fingerprints and secure information dispersal
• Efficient erasure correcting codes
• Fast modular transforms
• Founding Cryptography on Oblivious Transfer – Efficiently
• How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
• How to share a secret
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Linear Threshold Secret-Sharing with Binary Reconstruction
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Modern Coding Theory
• On linear-size pseudorandom generators and hardcore functions
• On the Evaluation of Powers and Monomials
• Practical threshold signatures
• Randomness conductors and constant-degree lossless expanders
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Secret sharing over infinite domains
• Secret-Sharing Schemes: A Survey
• Secure Computation from Random Error Correcting Codes
• Short signatures from the Weil pairing
• Threshold cryptosystems from threshold fully homomorphic encryption
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Universally ideal secret-sharing schemes
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)

Cited in

(1)

• Traceable secret sharing: strong security and efficient constructions

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)