scientific article; zbMATH DE number 1406785
From MaRDI portal
Publication:4940701
zbMath0939.94555MaRDI QIDQ4940701
Benny Chor, Moni Naor, Amos Fiat
Publication date: 1 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An upper bound on the size of a code with the \(k\)-identifiable parent property ⋮ Traceable secret sharing and applications ⋮ Improved algorithms for group testing with inhibitors ⋮ Protocols for collusion-secure asymmetric fingerprinting ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ White box traitor tracing ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Sequential and dynamic frameproof codes ⋮ Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection ⋮ Pirate decoder for the broadcast encryption schemes from Crypto 2005 ⋮ Codes for copyright protection: the case of two pirates ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Unnamed Item ⋮ Making \textit{any} attribute-based encryption accountable, efficiently ⋮ Separation and Witnesses ⋮ Equal-Weight Fingerprinting Codes ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ Watermarking PRFs against quantum adversaries ⋮ New approaches to traitor tracing with embedded identities ⋮ Black-box Trace\&Revoke codes ⋮ On tight bounds for binary frameproof codes ⋮ Complete tree subset difference broadcast encryption scheme and its analysis ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Tracing a linear subspace: application to linearly-homomorphic group signatures ⋮ Secure and Efficient Construction of Broadcast Encryption with Dealership ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ Adaptive multiparty NIKE ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Franchised quantum money ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Tracing quantum state distinguishers via backtracking ⋮ On non-binary traceability set systems ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Optimal 2-traceability codes of length 4 ⋮ Generalized hashing and parent-identifying codes. ⋮ Wide-sense 2-frameproof codes ⋮ Traceability codes ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Adaptively Secure Broadcast Encryption with Dealership ⋮ A Note About the Traceability Properties of Linear Codes ⋮ Some intriguing upper bounds for separating hash families ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems ⋮ Chameleon — A new kind of stream cipher ⋮ A note on the security of KHL scheme ⋮ ON APPLICATION OF ALGEBRAIC GEOMETRY CODES OF L-CONSTRUCTION IN COPY PROTECTION ⋮ Defending against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems ⋮ Fighting Pirates 2.0 ⋮ On traceability property of equidistant codes ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Fully collusion-resistant traitor tracing scheme with shorter ciphertexts ⋮ Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys ⋮ New constructions for IPP codes ⋮ Tracing Malicious Proxies in Proxy Re-encryption ⋮ Union-intersection-bounded families and their applications ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Scalable public-key tracing and revoking ⋮ Defending against the Pirate Evolution Attack ⋮ Trade-Off Traitor Tracing ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ Separable collusion-secure multimedia codes ⋮ Improved versions of Tardos' fingerprinting scheme ⋮ Traitors Collaborating in Public: Pirates 2.0 ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ A ramp model for distributed key distribution schemes ⋮ Intersecting codes and separating codes ⋮ Towards accountability in CRS generation ⋮ Identity-Based Trace and Revoke Schemes ⋮ Privacy-Aware Attribute-Based Encryption with User Accountability ⋮ A new key escrow cryptosystem ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ A class of I.P.P. codes with efficient identification ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ Efficient Traitor Tracing from Collusion Secure Codes ⋮ A public-key traitor tracing scheme with revocation using dynamic shares ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings ⋮ Anonymous trace and revoke ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
