Black-box Trace\&Revoke codes
From MaRDI portal
Publication:378263
DOI10.1007/s00453-012-9702-yzbMath1283.94077DBLPjournals/algorithmica/NgoPP13OpenAlexW1980101601WikidataQ56921016 ScholiaQ56921016MaRDI QIDQ378263
Duong Hieu Phan, David Pointcheval, Hung Quang Ngo
Publication date: 11 November 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9702-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of \(r\) others
- On the ratio of optimal integral and fractional covers
- Public Key Broadcast Encryption for Stateless Receivers
- A threshold of ln n for approximating set cover
- Traitor Tracing with Optimal Transmission Rate
- Tracing Many Users With Almost No Rate Penalty
- A Greedy Heuristic for the Set-Covering Problem
- A Revocation Scheme with Minimal Storage at Receivers
- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
- Combinatorial properties of frameproof and traceability codes
- Efficient Traitor Tracing from Collusion Secure Codes
- Applied Cryptography and Network Security
- Optimal probabilistic fingerprint codes
This page was built for publication: Black-box Trace\&Revoke codes