Computing on authenticated data
From MaRDI portal
Publication:2344052
DOI10.1007/s00145-014-9182-0zbMath1314.94100MaRDI QIDQ2344052
Dan Boneh, Brent Waters, Abhi Shelat, Susan Hohenberger, Jan Camenisch, Jae-Hyun Ahn
Publication date: 12 May 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9182-0
94A62: Authentication, digital signatures and secret sharing
Related Items
Multi-theorem preprocessing NIZKs from lattices, Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice, Protean Signature Schemes, Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signatures for network coding
- A simple transitive signature scheme for directed trees
- Homomorphic Signatures for Polynomial Functions
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Homomorphic Network Coding Signatures in the Standard Model
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Transitive Signatures: New Schemes and Proofs
- Secure Network Coding over the Integers
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Unlinkability of Sanitizable Signatures
- Fully Homomorphic Encryption over the Integers
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Redactable Signatures for Tree-Structured Data: Definitions and Constructions
- Generalized Identity Based and Broadcast Encryption Schemes
- Security of Sanitizable Signatures Revisited
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Network Coding Applications
- Short Redactable Signatures Using Random Trees
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New directions in cryptography
- Noninteractive Zero-Knowledge
- Group Signatures
- A method for obtaining digital signatures and public-key cryptosystems
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
- Transitive Signatures Based on Factoring and RSA
- Computationally Sound Proofs
- Identity-Based Encryption from the Weil Pairing
- Succinct Malleable NIZKs and an Application to Compact Shuffles
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Directed Transitive Signature Scheme
- Security in Communication Networks
- Sanitizable Signatures
