Pages that link to "Item:Q3600216"
From MaRDI portal
The following pages link to Circular-Secure Encryption from Decision Diffie-Hellman (Q3600216):
Displaying 25 items.
- Decaf: Eliminating Cofactors Through Point Compression (Q3457135) (← links)
- Security Against Related Randomness Attacks via Reconstructive Extractors (Q3460096) (← links)
- OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks (Q3627444) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Master-Key KDM-Secure IBE from Pairings (Q5041155) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- The KDM-CCA Security of REACT (Q5056009) (← links)
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption (Q5267417) (← links)
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (Q5738789) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- CCA security and trapdoor functions via key-dependent-message security (Q5918652) (← links)
- Wireless-channel key exchange (Q6057200) (← links)
- Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions (Q6108851) (← links)
- KDM security for the Fujisaki-Okamoto transformations in the QROM (Q6113959) (← links)
- Cryptographic primitives with hinting property (Q6135390) (← links)
- How to build a trapdoor function from an encryption scheme (Q6157550) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting (Q6192061) (← links)
- Cryptographic primitives with hinting property (Q6536746) (← links)
- SoK: learning with errors, circular security, and fully homomorphic encryption (Q6635900) (← links)
- Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6639504) (← links)
- Robust additive randomized encodings from IO and pseudo-non-linear codes (Q6653025) (← links)
