Computing on authenticated data: new privacy definitions and constructions
From MaRDI portal
Publication:4911596
Recommendations
Cited in
(35)- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Tagged one-time signatures: tight security and optimal tag size
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- A compiler for multi-key homomorphic signatures for Turing machines
- Linearly homomorphic signatures with designated combiner
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Linearly homomorphic structure-preserving signatures and their applications
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Computing on Authenticated Data
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- An alternative approach to public cloud data auditing supporting data dynamics
- Computing on authenticated data
- Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- QANIZK for adversary-dependent languages and their applications
- Homomorphic signatures for subset and superset mixed predicates and its applications
- An efficient homomorphic aggregate signature scheme based on lattice
- A new definition of homomorphic signature for identity management in mobile cloud computing
- Linearly Homomorphic Signatures with Designated Entities
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Verifiable pattern matching on outsourced texts
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- Subset signatures with controlled context-hiding
- Practical homomorphic message authenticators for arithmetic circuits
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice
- Attribute-based signatures for range of inner product and its applications
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Structure-preserving signatures and commitments to group elements
- Threshold structure-preserving signatures
- Linearly homomorphic authenticated encryption with provable correctness and public verifiability
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
This page was built for publication: Computing on authenticated data: new privacy definitions and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911596)
