Computing on Authenticated Data: New Privacy Definitions and Constructions

From MaRDI portal
Publication:4911596


DOI10.1007/978-3-642-34961-4_23zbMath1293.94053MaRDI QIDQ4911596

No author found.

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


94A62: Authentication, digital signatures and secret sharing


Related Items

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, Structure-preserving signatures and commitments to group elements, Linearly homomorphic structure-preserving signatures and their applications, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, An efficient homomorphic aggregate signature scheme based on lattice, 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, 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