Computing on Authenticated Data

DOI10.1007/978-3-642-28914-9_1MaRDI QIDQ2891473zbMATH OpenOpenAlexFDO

Authors Dan Boneh, Jan Camenisch, Susan Hohenberger, Abhi Shelat, Brent Waters, Jaehyun 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

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Computing on authenticated data
• Computing on authenticated data: new privacy definitions and constructions
• Verifiable computation on outsourced encrypted data
• A general model for authenticated data structures
• Authenticated data structures, generically
• Streaming authenticated data structures

Cited in

(33)

• An alternative approach to public cloud data auditing supporting data dynamics
• Attribute-based signatures for range of inner product and its applications
• The state of the union: union-only signatures for data aggregation
• Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
• SoK: signatures with randomizable keys
• A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
• Signature for objects: formalizing how to authenticate physical data and more
• Practical homomorphic message authenticators for arithmetic circuits
• Computing on authenticated data
• Identity-based quotable ring signature
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• Linearly homomorphic structure-preserving signatures and their applications
• Homomorphic signatures and message authentication codes
• Homomorphic signatures for polynomial functions
• Tracing a linear subspace: application to linearly-homomorphic group signatures
• Linearly-homomorphic signatures and scalable mix-nets
• Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
• Computing on authenticated data: new privacy definitions and constructions
• Efficient completely context-hiding quotable and linearly homomorphic signatures
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Fully homomorphic message authenticators
• Reconciling non-malleability with homomorphic encryption
• Information and Communications Security
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• Efficient universally-verifiable electronic voting with everlasting privacy
• Linearly homomorphic signatures with designated combiner
• Homomorphic signatures for subset and superset mixed predicates and its applications
• Non-malleable vector commitments via local equivocability
• QANIZK for adversary-dependent languages and their applications
• Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding
• An efficient homomorphic aggregate signature scheme based on lattice

This page was built for publication: Computing on Authenticated Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891473)