Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428142
DOI10.1007/B11817zbMATH Open1122.94359DBLPconf/crypto/2003OpenAlexW2480001466MaRDI QIDQ5428142FDOQ5428142
Authors: 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
Recommendations
Cited In (79)
- Non-malleable encryption: simpler, shorter, stronger
- Leakage resilience from program obfuscation
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
- Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
- Bounded CCA2-Secure Encryption
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- Theory of Cryptography
- Efficient bidirectional proxy re-encryption with direct chosen-ciphertext security
- Towards Key-Dependent Message Security in the Standard Model
- Conditional Proxy Broadcast Re-Encryption
- Natural sd-RCCA secure public-key encryptions
- Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security
- Title not available (Why is that?)
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Signcryption schemes with threshold unsigncryption, and applications
- Improved proxy re-encryption schemes with applications to secure distributed storage
- PRE: stronger security notions and efficient construction with non-interactive opening
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Non-malleable encryption: simpler, shorter, stronger
- Detecting dangerous queries: a new approach for chosen ciphertext security
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Combiners for chosen-ciphertext security
- The ECCA Security of Hybrid Encryptions
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- SEMD: secure and efficient message dissemination with policy enforcement in VANET
- On the gold standard for security of universal steganography
- Generic plaintext equality and inequality proofs
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Universal composition with responsive environments
- CCA secure \textit{a posteriori} openable encryption in the standard model
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Hardware security without secure hardware: how to decrypt with a password and a server
- Universally Composable Security Analysis of TLS
- Composable and finite computational security of quantum message transmission
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Enhanced chosen-ciphertext security and applications
- Universally composable symbolic security analysis
- Security under message-derived keys: signcryption in iMessage
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Abuse resistant law enforcement access systems
- Fully secure ABE with outsourced decryption against chosen ciphertext attack
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Interactive encryption and message authentication
- Public Key Cryptography – PKC 2004
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Revisiting (R)CCA security and replay protection
- Transferable e-cash: a cleaner model and the first practical instantiation
- Reconciling non-malleability with homomorphic encryption
- Amplification of Chosen-Ciphertext Security
- CCA updatable encryption against malicious re-encryption attacks
- Improving speed and security in updatable encryption schemes
- Tag-KEM/DEM: A new framework for hybrid encryption
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Fully secure threshold unsigncryption
- Parallel decryption queries in bounded chosen ciphertext attacks
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
- Grey-box public-key steganography
- Onion routing with replies
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
- Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE
- Sender-binding key encapsulation
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
- Chosen-ciphertext secure dual-receiver encryption in the standard model based on post-quantum assumptions
- SoK: public key encryption with openings
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions
- Development on security models for proxy re-encryption schemes
- Chosen ciphertext secure keyed two-level homomorphic encryption
- Traceable receipt-free encryption
This page was built for publication: Advances in Cryptology - CRYPTO 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428142)
