Pages that link to "Item:Q3563829"
From MaRDI portal
The following pages link to Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (Q3563829):
Displayed 50 items.
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Anonymous spatial encryption under affine space delegation functionality with full security (Q506150) (← links)
- An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
- An efficient ring signature scheme from pairings (Q528720) (← links)
- Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Functional encryption for computational hiding in prime order groups via pair encodings (Q1692153) (← links)
- Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
- Leakage-resilient attribute based encryption in prime-order groups via predicate encodings (Q1752551) (← links)
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
- Functional encryption for set intersection in the multi-client setting (Q2068378) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- New approaches to traitor tracing with embedded identities (Q2175935) (← links)
- Rerandomizable signatures under standard assumption (Q2179379) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Anonymous HIBE with short ciphertexts: full security in prime order groups (Q2256104) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- Predicate encryption supporting disjunctions, polynomial equations, and inner products (Q2377068) (← links)
- Automated analysis of cryptographic assumptions in generic group models (Q2423840) (← links)
- Improved hidden vector encryption with short ciphertexts and tokens (Q2430414) (← links)
- The relation and transformation between hierarchical inner product encryption and spatial encryption (Q2448081) (← links)
- Key regeneration-free ciphertext-policy attribute-based encryption and its application (Q2660936) (← links)
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice (Q2678984) (← links)
- Decentralized multi-client functional encryption for set intersection with improved efficiency (Q2692968) (← links)
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH (Q2697676) (← links)
- Déjà Q: Encore! Un Petit IBE (Q2799097) (← links)
- A Study of Pair Encodings: Predicate Encryption in Prime Order Groups (Q2799098) (← links)
- Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups (Q2801775) (← links)
- A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups (Q2827707) (← links)
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption (Q2948190) (← links)
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings (Q2953790) (← links)
- An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures (Q2953846) (← links)
- The Kernel Matrix Diffie-Hellman Assumption (Q2958145) (← links)
- Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups (Q2988340) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts (Q3181025) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes (Q5738892) (← links)
- Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges (Q5739024) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Fully adaptive decentralized multi-authority \textsf{ABE} (Q6063528) (← links)
- Pattern matching in encrypted stream from inner product encryption (Q6070782) (← links)
- Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded (Q6091135) (← links)
- On the security of functional encryption in the generic group model (Q6095189) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Chosen ciphertext secure keyed two-level homomorphic encryption (Q6108779) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting (Q6192061) (← links)