Watermarking cryptographic capabilities

DOI10.1145/2897518.2897651zbMath1377.94046OpenAlexW2416910455WikidataQ130969402 ScholiaQ130969402MaRDI QIDQ5361906

Vinod Vaikuntanathan, Justin Holmgren, Aloni Cohen, Ryo Nishimaki, Daniel Wichs

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1721.1/127690

zbMATH Keywords

pseudorandom functionswatermarkingindistinguishability obfuscation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (24)

Constraining and Watermarking PRFs from Milder Assumptions ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Watermarking PRFs under standard assumptions: public marking and security with extraction queries ⋮ White box traitor tracing ⋮ Fine-grained forward secrecy: allow-list/deny-list encryption and applications ⋮ Watermarking Cryptographic Capabilities ⋮ Puncturable identity-based and attribute-based encryption from lattices ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Constraining Pseudorandom Functions Privately ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software

This page was built for publication: Watermarking cryptographic capabilities