Advances in Cryptology - CRYPTO 2003

From MaRDI portal
Publication:5428142

DOI10.1007/b11817zbMath1122.94359OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428142

Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11817




Related Items (59)

Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolvedThe ECCA Security of Hybrid EncryptionsGeneric plaintext equality and inequality proofsAttribute-based conditional proxy re-encryption in the standard model under LWESelectively linkable group signatures -- stronger security and preserved verifiabilityOn the gold standard for security of universal steganographyChosen ciphertext secure keyed-homomorphic public-key cryptosystemsSponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length MessageComposable and finite computational security of quantum message transmissionHardware security without secure hardware: how to decrypt with a password and a serverReconciling non-malleability with homomorphic encryptionProxy-invisible CCA-secure type-based proxy re-encryption without random oraclesAugmented Learning with Errors: The Untapped Potential of the Error TermAlmost tightly-secure re-randomizable and replayable CCA-secure public key encryptionSender-binding key encapsulationUniversal Composition with Responsive EnvironmentsChosen ciphertext secure keyed two-level homomorphic encryptionA new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channelsAchievable \textsf{CCA2} relaxation for homomorphic encryptionMix-nets from re-randomizable and replayable CCA-secure public-key encryptionTraceable receipt-free encryptionEfficient bidirectional proxy re-encryption with direct chosen-ciphertext securityIdentity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBEOnion routing with repliesParaDiSE: efficient threshold authenticated encryption in fully malicious modelGroup homomorphic encryption: characterizations, impossibility results, and applicationsUniversally composable symbolic security analysisImproving speed and security in updatable encryption schemesCCA updatable encryption against malicious re-encryption attacksSigncryption schemes with threshold unsigncryption, and applicationsJoint state composition theorems for public-key encryption and digital signature functionalities with local computationNon-malleable encryption: simpler, shorter, strongerChosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertextsImproved proxy re-encryption schemes with applications to secure distributed storageImproving the efficiency of re-randomizable and replayable CCA secure public key encryptionChosen Ciphertext Secure Keyed-Homomorphic Public-Key EncryptionChosen-ciphertext secure anonymous conditional proxy re-encryption with keyword searchTag-KEM/DEM: A new framework for hybrid encryptionGrey-Box Public-Key SteganographyChosen-Ciphertext Secure Fully Homomorphic EncryptionStructure-Preserving Chosen-Ciphertext Security with Shorter Verifiable CiphertextsFully Secure Threshold UnsigncryptionPRE: stronger security notions and efficient construction with non-interactive openingSubtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?Unidirectional Chosen-Ciphertext Secure Proxy Re-encryptionNon-Malleable Encryption: Simpler, Shorter, StrongerSEMD: secure and efficient message dissemination with policy enforcement in VANETTowards Key-Dependent Message Security in the Standard ModelComputationally Sound Formalization of Rerandomizable RCCA Secure EncryptionSecurity under message-derived keys: signcryption in iMessageConditional Proxy Broadcast Re-EncryptionAbuse resistant law enforcement access systemsFully secure ABE with outsourced decryption against chosen ciphertext attackRevisiting (R)CCA security and replay protectionTransferable e-cash: a cleaner model and the first practical instantiationEfficient Conditional Proxy Re-encryption with Chosen-Ciphertext SecurityLeakage resilience from program obfuscationMessage Transmission with Reverse Firewalls—Secure Communication on Corrupted MachinesUniversally Composable Security Analysis of TLS




This page was built for publication: Advances in Cryptology - CRYPTO 2003