Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
From MaRDI portal
Publication:4916021
DOI10.1007/978-3-642-36362-7_24zbMath1314.94101MaRDI QIDQ4916021
No author found.
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_24
94A62: Authentication, digital signatures and secret sharing
Related Items
Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability, Structure-preserving linearly homomorphic signature with designated combiner for subspace, 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, Short tightly secure signatures for signing a vector of group elements: a new approach, Computing on authenticated data, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures, Verifiable Pattern Matching on Outsourced Texts, Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys, Structure-Preserving Signatures from Standard Assumptions, Revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Computing on Authenticated Data
- Malleable Proof Systems and Applications
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Homomorphic Signatures for Polynomial Functions
- Adaptive Pseudo-free Groups and Applications
- Commuting Signatures and Verifiable Encryption
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Homomorphic Network Coding Signatures in the Standard Model
- Randomizable Proofs and Delegatable Anonymous Credentials
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- About the Security of MTI/C0 and MQV
- Secure Network Coding over the Integers
- Preventing Pollution Attacks in Multi-source Network Coding
- Unlinkability of Sanitizable Signatures
- Fully Homomorphic Encryption over the Integers
- Redactable Signatures for Tree-Structured Data: Definitions and Constructions
- Structure-Preserving Signatures and Commitments to Group Elements
- Security of Sanitizable Signatures Revisited
- Signing a Linear Subspace: Signature Schemes for Network Coding
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
- Transitive Signatures Based on Factoring and RSA
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Automata, Languages and Programming
