Circular-Secure Encryption from Decision Diffie-Hellman
From MaRDI portal
Recommendations
- On the circular security of bit-encryption
- Circular chosen-ciphertext security with compact ciphertexts
- Reproducible circularly secure bit encryption: applications and realizations
- Reproducible circularly-secure bit encryption: applications and realizations
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Cryptographic agility and its relation to circular encryption
- Separations in circular security for arbitrary length key cycles
- On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
- Indistinguishability obfuscation from circular security
Cited in
(90)- The key-dependent message security of key-alternating Feistel ciphers
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Leakage-resilient key-dependent message secure encryption schemes
- KDM security for identity-based encryption: constructions and separations
- On symmetric encryption and point obfuscation
- Cryptographic primitives with hinting property
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- OAEP Is Secure under Key-Dependent Messages
- Permuted puzzles and cryptographic hardness
- How to Compute in the Presence of Leakage
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- Unidirectional updatable encryption and proxy re-encryption from DDH
- Incremental deterministic public-key encryption
- Toward fine-grained blackbox separations between semantic and circular-security notions
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Signature schemes secure against hard-to-invert leakage
- Multilinear pseudorandom functions
- Efficient KDM-CCA secure public-key encryption for polynomial functions
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Breaking the circuit size barrier for secure computation under DDH
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Garbled circuits as randomized encodings of functions: a primer
- Beyond Uber: instantiating generic groups via PGGs
- Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage
- Regular lossy functions and their applications in leakage-resilient cryptography
- The kernel matrix Diffie-Hellman assumption
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
- Multilinear maps from obfuscation
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Garbling XOR gates ``for free in the standard model
- How to build a trapdoor function from an encryption scheme
- More constructions of lossy and correlation-secure trapdoor functions
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Towards building efficient SCALES protocols
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Decaf: eliminating cofactors through point compression
- Key-dependent message security: generic amplification and completeness
- Better security for deterministic public-key encryption: the auxiliary-input setting
- On strong simulation and composable point obfuscation
- Wireless-channel key exchange
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
- Completeness of single-bit projection-KDM security for public key encryption
- Public-key encryption schemes with auxiliary inputs
- Batch-OT with optimal rate
- New definitions and separations for circular security
- More efficient construction of bounded KDM secure encryption
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Rerandomizable garbling, revisited
- Additive randomized encodings from public key encryption
- Verifiable random functions from standard assumptions
- CCA security and trapdoor functions via key-dependent-message security
- Updatable public key encryption in the standard model
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Master-key KDM-secure IBE from pairings
- Master-key KDM-secure ABE via predicate encoding
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
- CPA-to-CCA transformation for KDM security
- Cryptographic agility and its relation to circular encryption
- Enhanced trapdoor hashing from DDH and DCR
- Multi-key homomorphic secret sharing
- Naor-Yung paradigm with shared randomness and applications
- Public key encryption resilient to leakage and tampering attacks
- Security of signature schemes in the presence of key-dependent messages
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Cryptographic group actions and applications
- The KDM-CCA Security of REACT
- Reproducible circularly secure bit encryption: applications and realizations
- Circular security is complete for KDM security
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Naor-Yung Paradigm with Shared Randomness and Applications
- Cryptographic primitives with hinting property
- A survey of symbolic methods in computational analysis of cryptographic systems
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- On constructing homomorphic encryption schemes from coding theory
- SCALES. MPC with small clients and larger ephemeral servers
- An algebraic framework for Diffie-Hellman assumptions
- Bounded tamper resilience: how to go beyond the algebraic barrier
- Key-dependent message security for division function: discouraging anonymous credential sharing
- Security Against Related Randomness Attacks via Reconstructive Extractors
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions
- Bounded KDM security from iO and OWF
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
This page was built for publication: Circular-Secure Encryption from Decision Diffie-Hellman
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600216)
