Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
From MaRDI portal
Publication:3563829
DOI10.1007/978-3-642-13190-5_3zbMath1279.94074OpenAlexW2146689848MaRDI QIDQ3563829
Publication date: 1 June 2010
Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_3
Related Items (50)
Traitor-tracing from LWE made simple and attribute-based ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Predicate encryption supporting disjunctions, polynomial equations, and inner products ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Key regeneration-free ciphertext-policy attribute-based encryption and its application ⋮ New approaches to traitor tracing with embedded identities ⋮ Rerandomizable signatures under standard assumption ⋮ Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption ⋮ A survey of elliptic curves for proof systems ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Pattern matching in encrypted stream from inner product encryption ⋮ Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ Shorter identity-based encryption via asymmetric pairings ⋮ An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ On the security of functional encryption in the generic group model ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Chosen ciphertext secure keyed two-level homomorphic encryption ⋮ Functional encryption for computational hiding in prime order groups via pair encodings ⋮ Automated analysis of cryptographic assumptions in generic group models ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Improved hidden vector encryption with short ciphertexts and tokens ⋮ Decentralized multi-client functional encryption for set intersection with improved efficiency ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ The relation and transformation between hierarchical inner product encryption and spatial encryption ⋮ Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Leakage-resilient attribute based encryption in prime-order groups via predicate encodings ⋮ An efficient ring signature scheme from pairings ⋮ Anonymous HIBE with short ciphertexts: full security in prime order groups ⋮ Simplifying Design and Analysis of Complex Predicate Encryption Schemes ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ Déjà Q: Encore! Un Petit IBE ⋮ A Study of Pair Encodings: Predicate Encryption in Prime Order Groups ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups ⋮ A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups ⋮ Functional encryption for set intersection in the multi-client setting ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
Uses Software
This page was built for publication: Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
