Pages that link to "Item:Q656924"
From MaRDI portal
The following pages link to Efficient selective identity-based encryption without random oracles (Q656924):
Displaying 39 items.
- Combined schemes for signature and encryption: the public-key and the identity-based setting (Q259033) (← links)
- An efficient IBE scheme with tight security reduction in the random oracle model (Q264126) (← links)
- Practical hybrid (hierarchical) identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption (Q381130) (← links)
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency (Q511917) (← links)
- Efficient identity-based encryption from LWR (Q776369) (← links)
- Revocable hierarchical identity-based encryption with shorter private keys and update keys (Q1671645) (← links)
- From selective IBE to full IBE and selective HIBE (Q1690200) (← links)
- Compact IBBE and fuzzy IBE from simple assumptions (Q1796820) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Generic negation of pair encodings (Q2061950) (← links)
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge (Q2214958) (← links)
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more (Q2215969) (← links)
- Anonymous HIBE with short ciphertexts: full security in prime order groups (Q2256104) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) (← links)
- Attribute-based proxy re-encryption from standard lattices (Q2661778) (← links)
- Adaptively secure inner product encryption from LWE (Q2691591) (← links)
- Unbounded HIBE with tight security (Q2692379) (← links)
- Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions (Q2822675) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- A Novel Commutative Blinding Identity Based Encryption Scheme (Q2889819) (← links)
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions (Q2946437) (← links)
- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Constructions of CCA-Secure Revocable Identity-Based Encryption (Q3194596) (← links)
- Boneh-Boyen IBE (Q5050188) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307256) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311549) (← links)
- Identity-Based Parallel Key-Insulated Encryption Without Random Oracles: Security Notions and Construction (Q5458293) (← links)
- Topics in Cryptology – CT-RSA 2004 (Q5901685) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Bounded-collusion decentralized ABE with sublinear parameters (Q6040630) (← links)
- Certificateless encryption scheme with provable security in the standard model suitable for mobile devices (Q6125211) (← links)
- Identity-based matchmaking encryption without random oracles (Q6157600) (← links)
- Linear-map vector commitments and their practical applications (Q6175974) (← links)
- Hierarchical and non-monotonic key-policy attribute-based encryption and its application (Q6204161) (← links)
- \textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity (Q6618628) (← links)