Homomorphic Encryption and Signatures from Vector Decomposition

DOI10.1007/978-3-540-85538-5_4zbMath1186.94464OpenAlexW1601334779MaRDI QIDQ3600493

Katsuyuki Takashima, Tatsuaki Okamoto

Publication date: 10 February 2009

Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_4

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (19)

Short Attribute-Based Signatures for Threshold Predicates ⋮ Rerandomizable signatures under standard assumption ⋮ Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption ⋮ Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption ⋮ Shorter identity-based encryption via asymmetric pairings ⋮ Key-policy ABE with switchable attributes ⋮ Identity-based matchmaking encryption from standard assumptions ⋮ A survey on functional encryption ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ The relation and transformation between hierarchical inner product encryption and spatial encryption ⋮ Efficient Inner Product Encryption with Simulation-Based Security ⋮ Some Key Techniques on Pairing Vector Spaces ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Fully secure functional encryption with a large class of relations from the decisional linear assumption ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ More Efficient Constructions for Inner-Product Encryption ⋮ Anonymous Encryption with Partial-Order Subset Delegation Functionality ⋮ Towards Restricting Plaintext Space in Public Key Encryption ⋮ A new approach to practical function-private inner product encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Efficiently Computable Distortion Maps for Supersingular Curves
• Perfect Non-interactive Zero Knowledge for NP
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Distortion maps for supersingular genus two curves
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Advances in Cryptology – CRYPTO 2004
• Hyperelliptic Pairings
• Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
• Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
• An Analysis of the Vector Decomposition Problem
• Theory of Cryptography

This page was built for publication: Homomorphic Encryption and Signatures from Vector Decomposition