Accountability for misbehavior in threshold decryption via threshold traitor tracing
From MaRDI portal
Publication:6653012
DOI10.1007/978-3-031-68394-7_11MaRDI QIDQ6653012
Aditi Partap, Lior Rotem, Dan Boneh
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?)
- Traitor-tracing from LWE made simple and attribute-based
- Compact multi-signatures for smaller blockchains
- The algebraic group model and its applications
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- A classification of computational assumptions in the algebraic group model
- Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
- MuSig2: simple two-round Schnorr multi-signatures
- Traceable secret sharing and applications
- New approaches to traitor tracing with embedded identities
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Traitor Tracing for Stateful Pirate Decoders with Constant Ciphertext Rate
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- The Uber-Assumption Family
- Securing threshold cryptosystems against chosen ciphertext attack
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Collusion-secure fingerprinting for digital data
- A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure
- Collusion resistant traitor tracing from learning with errors
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Efficient Traitor Tracing from Collusion Secure Codes
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
- Topics in Cryptology – CT-RSA 2006
- Optimal probabilistic fingerprint codes
- Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin
- Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
This page was built for publication: Accountability for misbehavior in threshold decryption via threshold traitor tracing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653012)
