Computing on Authenticated Data

DOI10.1007/978-3-642-28914-9_1zbMath1292.94017MaRDI QIDQ2891473

Brent Waters, Dan Boneh, Jan Camenisch, Susan Hohenberger, Abhi Shelat, Jae-Hyun Ahn

Publication date: 15 June 2012

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_1

Mathematics Subject Classification ID

94A62: Authentication, digital signatures and secret sharing

Related Items

Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, Chameleon-Hashes with Ephemeral Trapdoors, Non-malleable vector commitments via local equivocability, Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding, Attribute-based signatures for range of inner product and its applications, The state of the union: union-only signatures for data aggregation, 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, Identity-based quotable ring signature, A more efficient leveled strongly-unforgeable fully homomorphic signature scheme, Linearly-homomorphic signatures and scalable mix-nets, An alternative approach to public cloud data auditing supporting data dynamics, Reconciling non-malleability with homomorphic encryption, 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, Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives, Zero-Knowledge Authenticated Order Queries and Order Statistics on a List, Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees