Traceable secret sharing: strong security and efficient constructions
From MaRDI portal
Publication:6652970
DOI10.1007/978-3-031-68388-6_9MaRDI QIDQ6652970
Dan Boneh, Aditi Partap, Lior Rotem
Publication date: 13 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Traitor-tracing from LWE made simple and attribute-based
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- Traceable secret sharing and applications
- Chinese remaindering with errors
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Asymmetric Fingerprinting
- Traitor Tracing for Stateful Pirate Decoders with Constant Ciphertext Rate
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- How to share a secret
- Polynomial Codes Over Certain Finite Fields
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Probabilistic Algorithms in Finite Fields
- Foundations of Cryptography
- Efficient Construction of (Distributed) Verifiable Random Functions
- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
- A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure
- Explicit, almost optimal, epsilon-balanced codes
- How to Share a Secret
- A modular approach to key safeguarding
- Collusion resistant traitor tracing from learning with errors
- Public Traceability in Traitor Tracing Schemes
- Secure Computation from Random Error Correcting Codes
- Factoring Polynomials Over Large Finite Fields
- Public Key Cryptography - PKC 2005
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Optimal probabilistic fingerprint codes
- Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin
- How to recover a secret with \(O(n)\) additions
- Cryptography with weights: MPC, encryption and signatures
This page was built for publication: Traceable secret sharing: strong security and efficient constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652970)
