Circular-Secure Encryption from Decision Diffie-Hellman
From MaRDI portal
Publication:3600216
DOI10.1007/978-3-540-85174-5_7zbMath1183.94025OpenAlexW1949164874MaRDI QIDQ3600216
Shai Halevi, Dan Boneh, Rafail Ostrovsky, Mike Hamburg
Publication date: 10 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_7
Related Items
The key-dependent message security of key-alternating Feistel ciphers, Master-Key KDM-Secure IBE from Pairings, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, Signature schemes secure against hard-to-invert leakage, Multilinear Pseudorandom Functions, How to Compute in the Presence of Leakage, The KDM-CCA Security of REACT, Garbling XOR gates ``for free in the standard model, Decaf: Eliminating Cofactors Through Point Compression, Regular lossy functions and their applications in leakage-resilient cryptography, Security Against Related Randomness Attacks via Reconstructive Extractors, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, Anonymous IBE, leakage resilience and circular security from new assumptions, Naor-Yung paradigm with shared randomness and applications, Public key encryption resilient to leakage and tampering attacks, Batch-OT with optimal rate, CPA-to-CCA transformation for KDM security, Permuted puzzles and cryptographic hardness, Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version, Wireless-channel key exchange, Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions, Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage, Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model, Unidirectional updatable encryption and proxy re-encryption from DDH, Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions, KDM security for the Fujisaki-Okamoto transformations in the QROM, SCALES. MPC with small clients and larger ephemeral servers, The Kernel Matrix Diffie-Hellman Assumption, Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions, Cryptographic primitives with hinting property, Universal amplification of KDM security: from 1-key circular to multi-key KDM, How to build a trapdoor function from an encryption scheme, Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?, Beyond Uber: instantiating generic groups via PGGs, Reproducible circularly secure bit encryption: applications and realizations, Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN, Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting, More constructions of lossy and correlation-secure trapdoor functions, Circular security is complete for KDM security, Cryptographic group actions and applications, Updatable public key encryption in the standard model, KDM security for identity-based encryption: constructions and separations, Incremental deterministic public-key encryption, Bounded tamper resilience: how to go beyond the algebraic barrier, An algebraic framework for Diffie-Hellman assumptions, Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings, Separating IND-CPA and Circular Security for Unbounded Length Key Cycles, Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation, A survey of symbolic methods in computational analysis of cryptographic systems, OAEP Is Secure under Key-Dependent Messages, Completeness of Single-Bit Projection-KDM Security for Public Key Encryption, Verifiable Random Functions from Standard Assumptions, Multilinear Maps from Obfuscation, Security of signature schemes in the presence of key-dependent messages, CCA security and trapdoor functions via key-dependent-message security, Key-dependent message security: generic amplification and completeness, A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks, Better security for deterministic public-key encryption: the auxiliary-input setting, On strong simulation and composable point obfuscation, Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing, Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks, Master-key KDM-secure ABE via predicate encoding, Naor-Yung Paradigm with Shared Randomness and Applications, Bounded KDM Security from iO and OWF, Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE, Circular Security Separations for Arbitrary Length Cycles from LWE, On Constructing Homomorphic Encryption Schemes from Coding Theory, Breaking the Circuit Size Barrier for Secure Computation Under DDH, On Symmetric Encryption and Point Obfuscation, Public-Key Encryption Schemes with Auxiliary Inputs, Breaking the decisional Diffie-Hellman problem for class group actions using genus theory, Garbled Circuits as Randomized Encodings of Functions: a Primer, Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption, Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
