Theory of Cryptography
From MaRDI portal
Publication:5901770
DOI10.1007/b95566zbMath1197.94188OpenAlexW2498336418MaRDI QIDQ5901770
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95566
Related Items
Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved, Chosen ciphertext secure keyed-homomorphic public-key cryptosystems, Reconciling non-malleability with homomorphic encryption, Augmented Learning with Errors: The Untapped Potential of the Error Term, Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption, 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, Improving the efficiency of re-randomizable and replayable CCA secure public key encryption, Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption, Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts, Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?, Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption, Security under message-derived keys: signcryption in iMessage, Aggregatable distributed key generation, Revisiting (R)CCA security and replay protection, Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines
