Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Annual International Cryptology Conference

• Publication date

  1999-08-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-48405-1_33
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Private communication

  1999influential reference
• A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

  1998influential reference
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998cited by this paper
• Public-key cryptography and password protocols

  1998cited by this paper
• Relations among Notions of Security for Public-Key Encryption Schemes

  1998influential reference
• Optimal Asymmetric Encryption-How to Encrypt with RSA

  1995cited by this paper
• Non-malleable cryptography

  1991influential reference
• Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

  1991cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990cited by this paper
• The Notion of Security for Probabilistic Cryptosystems

  1986cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• Theory and application of trapdoor functions

  1982cited by this paper
• Theory and Applications of Trapdoor Functions (Extended Abstract)

  1982cited by this paper

• On security notions for encryption in a quantum world

  2025influential citation
• Always by Your Side: Constructing Traceable Anonymous Credentials with Hardware-Binding

  2025cites this paper
• Cryptography without Long-Term Quantum Memory and Global Entanglement

  2025cites this paper
• Is the JCJ voting system really coercion-resistant?

  2024cites this paper
• Separations among formulations of non-malleable encryption under valid ciphertext condition

  2023influential citation
• BLDSS: A Blockchain-Based Lightweight Searchable Data Sharing Scheme in Vehicular Social Networks

  2023cites this paper
• On the Complete Non-Malleability of the Fujisaki-Okamoto Transform

  2022influential citation
• Machine-checked proofs of privacy against malicious boards for Selene & Co

  2022cites this paper
• On IND-qCCA Security in the ROM and Its Applications - CPA Security Is Sufficient for TLS 1.3

  2022influential citation
• Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios

  2021cites this paper
• Fortified Multi-Party Computation: Taking Advantage of Simple Secure Hardware Modules

  2021cites this paper
• 2FE: Two-Factor Encryption for Cloud Storage

  2020cites this paper
• CLIENT CENTRIC PROXY RE-ENCRYPTION FOR OUTSOURCED DATA IN THE CLOUD

  2020cites this paper
• On the Security Notions for Encryption in a Quantum World

  2020cites this paper
• Non-malleability for quantum public-key encryption

  2019cites this paper
• Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions

  2019cites this paper
• AP-PRE: Autonomous Path Proxy Re-Encryption and Its Applications

  2019cites this paper
• A Novel Text Encryption Algorithm Based on the Two-Square Cipher and Caesar Cipher

  2018cites this paper
• Secret, verifiable auctions from elections

  2018cites this paper
• Authentication with weaker trust assumptions for voting systems

  2018influential citation
• Non-malleability vs. CCA-Security: The Case of Commitments

  2018influential citation
• Quantum Plaintext Non-Malleability

  2018cites this paper
• Verifiability of Helios Mixnet

  2018cites this paper
• Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios

  2018cites this paper
• Insight of the protection for data security under selective opening attacks

  2017cites this paper
• Conception de mécanismes d'accréditations anonymes et d'anonymisation de données. (Design of Anonymous Accreditation and Data Anonymization Mechanisms)

  2017cites this paper
• Secure Causal Atomic Broadcast, Revisited

  2017cites this paper
• Improved, black-box, non-malleable encryption from semantic security

  2017cites this paper
• Non-Malleable Functions and their Applications

  2016cites this paper
• Non-malleable Encryption: Simpler, Shorter, Stronger

  2016influential citation
• Reconciling Non-malleability with Homomorphic Encryption

  2016cites this paper
• Security of Identity-Based Encryption Schemes from Quadratic Residues

  2016cites this paper
• Security protocols in a nutshell

  2016cites this paper
• Secrecy and independence for election schemes

  2015cites this paper
• Computational Election Verifiability: Definitions and an Analysis of Helios and JCJ

  2015influential citation
• Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage

  2015cites this paper
• An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption

  2015influential citation
• Traceability, linkability and policy hiding in attribute-based signature schemes

  2015cites this paper
• Adaptive proofs of knowledge in the random oracle model

  2015influential citation
• Non-malleability Under Selective Opening Attacks: Implication and Separation

  2015influential citation
• NM-CPA Secure Encryption with Proofs of Plaintext Knowledge

  2015influential citation
• Constructing secret, verifiable auction schemes from election schemes

  2015cites this paper
• Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms

  2015cites this paper
• Advances in Information and Computer Security

  2015influential citation
• Privacy-preserving audit mechanisms for multi-party protocols

  2015cites this paper
• Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ

  2015cites this paper
• Standard versus Selective Opening Security: Separation and Equivalence Results

  2014cites this paper
• Ballot secrecy and ballot independence: definitions and relations

  2014cites this paper
• Zero-knowledge proofs in theory and practice

  2014influential citation
• Explicit Non-Malleable Codes Resistant to Permutations

  2014cites this paper
• Authentication in Insecure Environments

  2014cites this paper
• Self-Destruct Non-Malleability

  2014cites this paper
• Non-malleable Multiple Public-Key Encryption

  2014cites this paper
• Sicherheit kryptographischer Systeme

  2014cites this paper
• Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited

  2013cites this paper
• Ballot Secrecy and Ballot Independence Coincide

  2013cites this paper
• Cryptographic Voting - A Gentle Introduction

  2013cites this paper
• Secure second price auctions with a rational auctioneer

  2013influential citation
• An algorithm that earning users' trust on cloud

  2013cites this paper
• Targeted malleability: homomorphic encryption for restricted computations

  2012cites this paper
• How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios

  2012cites this paper
• Lattice-based completely non-malleable public-key encryption in the standard model

  2012cites this paper
• On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

  2012cites this paper
• New security notions and relations for public-key encryption

  2012cites this paper
• On Necessary and Sufficient Conditions for Private Ballot Submission

  2012influential citation
• Oblivious and Fair Server-Aided Two-Party Computation

  2012cites this paper
• Relations among Notions of Privacy for RFID Authentication Protocols

  2012cites this paper
• Relations between Constrained and Bounded Chosen Ciphertext Security for Key Encapsulation Mechanisms

  2012influential citation
• Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security

  2012influential citation
• Expedient Non-malleability Notions for Hash Functions

  2011cites this paper
• DESIGNING AN IMAGE CRYPTOGRAPHY SYSTEM USING THE IMAGE ELEMENTS AS CIPHERING KEYS

  2011cites this paper
• Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks

  2011influential citation
• Direct Constructions of Bidirectional Proxy Re-Encryption with Alleviated Trust in Proxy

  2011cites this paper
• Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity

  2011cites this paper
• Strong Knowledge Extractors for Public-Key Encryption Schemes

  2010influential citation
• Concurrent Knowledge Extraction in Public-Key Models

  2010cites this paper
• Efficient Completely Non-malleable Public Key Encryption

  2010cites this paper
• Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles

  2010influential citation
• Some (in)sufficient conditions for secure hybrid encryption

  2010cites this paper
• Bit Encryption Is Complete

  2009influential citation
• Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption

  2009cites this paper
• Concurrent Knowledge Extraction in the Public-Key Model

  2009cites this paper
• On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model

  2009cites this paper
• À LA FACULTÉ INFORMATIQUE ET COMMUNICATIONS LABORATOIRE DE SÉCURITÉ ET DE CRYPTOGRAPHIE PROGRAMME DOCTORAL EN INFORMATIQUE, COMMUNICATIONS ET INFORMATION

  2009cites this paper
• The Structure of Secure Multi-Party Computation

  2009cites this paper
• On Universally Composable KEM, DEM and Three Cryptographic Channels

  2009influential citation
• Nonce-aware encryption

  2009cites this paper
• User-aided data authentication Pre-draft

  2009cites this paper
• Non-malleable Schemes Resisting Adaptive Adversaries

  2009cites this paper
• On the security and efficiency of encryption

  2009cites this paper
• Security on Hybrid Encryption with the Tag-KEM/DEM Framework

  2009influential citation
• A simple construction for public-key encryption with revocable anonymity: the honest-sender case

  2009cites this paper
• Foundations of Non-malleable Hash and One-Way Functions

  2009cites this paper
• User-aided data authentication

  2009cites this paper
• Comparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability

  2008cites this paper
• On the Equivalence of Several Security Notions of KEM and DEM

  2008influential citation
• Completely Non-malleable Encryption Revisited

  2008influential citation
• Homomorphic Encryption with CCA Security

  2008cites this paper
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

  2008cites this paper
• SAS-Based Group Authentication and Key Agreement Protocols

  2008cites this paper