Computing on authenticated data: new privacy definitions and constructions

DOI10.1007/978-3-642-34961-4_23zbMATH Open1293.94053OpenAlexW2156539019MaRDI QIDQ4911596FDOQ4911596

Author name not available (Why is that?)

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

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

zbMATH Keywords

provable securitystandard modelprivacyunlinkabilityhomomorphic signatures

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (33)

• An alternative approach to public cloud data auditing supporting data dynamics
• Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
• Threshold structure-preserving signatures
• A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
• Title not available (Why is that?)
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Practical homomorphic message authenticators for arithmetic circuits
• A compiler for multi-key homomorphic signatures for Turing machines
• Computing on authenticated data
• Structure-preserving signatures and commitments to group elements
• CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
• Linearly Homomorphic Signatures with Designated Entities
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Linearly homomorphic structure-preserving signatures and their applications
• Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
• Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• Verifiable Pattern Matching on Outsourced Texts
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones
• Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
• Homomorphic signatures for subset and superset mixed predicates and its applications
• Linearly homomorphic signatures with designated combiner
• Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding
• QANIZK for adversary-dependent languages and their applications
• Computing on Authenticated Data
• An efficient homomorphic aggregate signature scheme based on lattice
• Attribute-based signatures for range of inner product and its 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)