Pages that link to "Item:Q3562884"
From MaRDI portal
The following pages link to Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model (Q3562884):
Displaying 16 items.
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Dynamic and efficient joint encryption scheme in the plain public key model (Q1013359) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman (Q2293251) (← links)
- Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More (Q2890012) (← links)
- Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption (Q3092354) (← links)
- CCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model (Q3166827) (← links)
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model (Q3195263) (← links)
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys (Q3457069) (← links)
- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model (Q3593102) (← links)
- Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited (Q4916018) (← links)
- Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem (Q5750816) (← links)
- Cryptanalysis and improvement of ``group public key encryption scheme supporting equality test without bilinear pairings'' (Q6500410) (← links)
