Converting pairing-based cryptosystems from composite-order groups to prime-order groups
From MaRDI portal
Recommendations
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Tools for simulating features of composite order bilinear groups in the prime order setting
- A profitable sub-prime loan: obtaining the advantages of composite order in prime-order bilinear groups
- Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
- Limitations on transformations from composite-order to prime-order groups: the case of round-optimal blind signatures
Cited in
(70)- Towards static assumption based cryptosystem in pairing setting: further applications of DéjàQ and dual-form signature (extended abstract)
- Traitor-tracing from LWE made simple and attribute-based
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Functional encryption for computational hiding in prime order groups via pair encodings
- Adaptively simulation-secure attribute-hiding predicate encryption
- Leakage-resilient attribute based encryption in prime-order groups via predicate encodings
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Functional encryption for set intersection in the multi-client setting
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- New approaches to traitor tracing with embedded identities
- Rerandomizable signatures under standard assumption
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Anonymous HIBE with short ciphertexts: full security in prime order groups
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Automated analysis of cryptographic assumptions in generic group models
- Improved hidden vector encryption with short ciphertexts and tokens
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Key regeneration-free ciphertext-policy attribute-based encryption and its application
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Decentralized multi-client functional encryption for set intersection with improved efficiency
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- 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
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- Converting cryptographic schemes from symmetric to asymmetric bilinear groups
- Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
- Tools for simulating features of composite order bilinear groups in the prime order setting
- A profitable sub-prime loan: obtaining the advantages of composite order in prime-order bilinear groups
- Efficient statically-secure large-universe multi-authority attribute-based encryption
- Dual system encryption framework in prime-order groups via computational pair encodings
- An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures
- The kernel matrix Diffie-Hellman assumption
- Transforming hidden vector encryption schemes from composite to prime order groups
- Limitations on transformations from composite-order to prime-order groups: the case of round-optimal blind signatures
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Shorter identity-based encryption via asymmetric pairings
- On the (Im)possibility of projecting property in prime-order setting
- Anonymous spatial encryption under affine space delegation functionality with full security
- Collusion resistant traitor tracing from learning with errors
- An algebraic framework for Diffie-Hellman assumptions
- An efficient ring signature scheme from pairings
- Bilinear Groups of Composite Order
- Simplifying design and analysis of complex predicate encryption schemes
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- A survey of elliptic curves for proof systems
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Pattern matching in encrypted stream from inner product encryption
- 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
- 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
- On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption
- Curves with Fast Computations in the First Pairing Group
- Decentralized Evaluation of Quadratic Polynomials on Encrypted Data
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Limits on the power of prime-order groups: separating Q-type from static assumptions
- Fully anonymous secret sharing
- Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
- Batch point compression in the context of advanced pairing-based protocols
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Fully collusion resistant traceable identity-based inner product functional encryption
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
This page was built for publication: Converting pairing-based cryptosystems from composite-order groups to prime-order groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563829)
