Computing on authenticated data: new privacy definitions and constructions

DOI10.1007/978-3-642-34961-4_23MaRDI QIDQ4911596zbMATH OpenOpenAlexFDO

Authors

Publication date 19 March 2013

Published in Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34961-4_23

zbMATH Keywords

homomorphic signaturesprivacyprovable securitystandard modelunlinkability

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Computing on authenticated data
• Efficient completely context-hiding quotable and linearly homomorphic signatures
• Computing on Authenticated Data
• On the security notions for homomorphic signatures
• scientific article; zbMATH DE number 2079932

Cited in

(36)

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

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)