Watermarking cryptographic functionalities from standard lattice assumptions
From MaRDI portal
Recommendations
- Watermarking cryptographic functionalities from standard lattice assumptions
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Watermarking cryptographic capabilities
- Public-key watermarking schemes for pseudorandom functions
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Advances in Cryptology - EUROCRYPT 2004
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Anonymous traitor tracing: how to embed arbitrary information in a key
- Attribute-based encryption for circuits
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Classical hardness of learning with errors
- Collusion resistant traitor tracing from learning with errors
- Collusion resistant watermarking schemes for cryptographic functionalities
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained pseudorandom functions and their applications
- Constraining pseudorandom functions privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient lattice (H)IBE in the standard model
- Efficient Traitor Tracing from Collusion Secure Codes
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster Bootstrapping with Polynomial Error
- From Weak to Strong Watermarking
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption for inner product predicates from learning with errors
- Functional signatures and pseudorandom functions
- Fuzzy Identity-Based Encryption
- Generating shorter bases for hard random lattices
- Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- Hardness of \(k\)-LWE and applications in traitor tracing
- Hardness of SIS and LWE with small parameters
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic signatures for polynomial functions
- How to watermark cryptographic functions
- scientific article; zbMATH DE number 2085429 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1303119 (Why is no real title available?)
- scientific article; zbMATH DE number 1341875 (Why is no real title available?)
- scientific article; zbMATH DE number 1088228 (Why is no real title available?)
- scientific article; zbMATH DE number 2086724 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- scientific article; zbMATH DE number 1418304 (Why is no real title available?)
- Identity-Based Traitor Tracing
- Key homomorphic PRFs and their applications
- Key-homomorphic constrained pseudorandom functions
- Lattice-based FHE as secure as PKE
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- New and improved key-homomorphic pseudorandom functions
- New approaches to traitor tracing with embedded identities
- On lattices, learning with errors, random linear codes, and cryptography
- On the (im)possibility of obfuscating programs
- Predicate encryption for circuits from LWE
- Predicate encryption for multi-dimensional range queries from lattices
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Private constrained PRFs (and more) from LWE
- Private puncturable PRFs from standard lattice assumptions
- Privately constraining and programming PRFs, the LWE way
- Pseudorandom functions and lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public Traceability in Traitor Tracing Schemes
- Public-key cryptosystems from the worst-case shortest vector problem
- Riding on asymmetry: efficient ABE for branching programs
- Risky traitor tracing and new differential privacy negative results
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Targeted homomorphic attribute-based encryption
- Tracing traitors
- Traitor Tracing with Optimal Transmission Rate
- Traitor-tracing from LWE made simple and attribute-based
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
- Watermarking cryptographic capabilities
- Watermarking cryptographic functionalities from standard lattice assumptions
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Watermarking public-key cryptographic primitives
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(7)- Watermarking PRFs against quantum adversaries
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- How to watermark cryptographic functions
- Watermarking cryptographic functionalities from standard lattice assumptions
- Watermarkable public key encryption with efficient extraction under standard assumptions
- Optimal single-server private information retrieval
- Watermarking PRFs and PKE against quantum adversaries
This page was built for publication: Watermarking cryptographic functionalities from standard lattice assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918350)
