scientific article; zbMATH DE number 1951605
From MaRDI portal
Publication:4413854
zbMath1027.68594MaRDI QIDQ4413854
Thomas Shrimpton, Phillip Rogaway, John Black
Publication date: 21 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2595/25950062.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (59)
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 ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ The KDM-CCA Security of REACT ⋮ Garbling XOR gates ``for free in the standard model ⋮ 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 ⋮ Delegating quantum computation in the quantum random oracle model ⋮ CPA-to-CCA transformation for KDM security ⋮ $\mathsf{sMGM}$: parameterizable AEAD mode ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Unidirectional updatable encryption and proxy re-encryption from DDH ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Cryptographic primitives with hinting property ⋮ Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ On the Unprovable Security of 2-Key XCBC ⋮ Security of message authentication codes in the presence of key-dependent messages ⋮ Augmented random oracles ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Circular security is complete for KDM security ⋮ The cost of adaptivity in security games on graphs ⋮ Updatable public key encryption in the standard model ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Cryptographically-masked flows ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model ⋮ Robust Encryption, Revisited ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ 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 ⋮ Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption ⋮ Clever Arbiters Versus Malicious Adversaries ⋮ Towards Key-Dependent Message Security in the Standard Model ⋮ Ideal Key Derivation and Encryption in Simulation-Based Security ⋮ 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 ⋮ On strong simulation and composable point obfuscation ⋮ Security under message-derived keys: signcryption in iMessage ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ 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 Symmetric Encryption and Point Obfuscation ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for publication:
