Coding constructions for blacklisting problems without computational assumptions
From MaRDI portal
Recommendations
- Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem
- Black-box constructions for secure computation
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Black-box constructions of protocols for secure computation
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Links between complexity theory and constrained block coding
- A NP-complete problem in coding theory with application to code based cryptography
- Black-box constructions of composable protocols without set-up
- Explicit constructions of optimal conflict-avoiding codes
- Coding Against Deletions in Oblivious and Online Models
Cited in
(26)- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Generalized cover-free families.
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Predicate signatures from pair encodings via dual system proof technique
- Union-intersection-bounded families and their applications
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- New combinatorial structures with applications to efficient group testing with inhibitors
- A public-key traitor tracing scheme with revocation using dynamic shares
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Two-dimensional representation of cover free families and its applications: short signatures and more
- Linear Time Constructions of Some d-Restriction Problems
- A black-box construction of strongly unforgeable signature schemes in the bounded leakage model
- Fighting Pirates 2.0
- Attribute-Based Broadcast Encryption Scheme Made Efficient
- Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem
- Multi-round secure light-weight broadcast exclusion protocol with pre-processing
- Binary representations of underdetermined data and superimposed codes
- Separation and Witnesses
- Bounds and algorithms for generalized superimposed codes
- A New Design of Online/Offline Signatures Based on Lattice
- Lattice-based programmable hash functions and applications
- A survey of cover-free families: constructions, applications, and generalizations
- Broadcast encryption using sum-product decomposition of Boolean functions
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
This page was built for publication: Coding constructions for blacklisting problems without computational assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941882)
