Public-key cryptosystems provably secure against chosen ciphertext attacks

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Symposium on the Theory of Computing

• Publication date

  1990-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/100216.100273
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Composition

  1992cited by this paper
• Non-interactive zero-knowledge proof systems

  1991cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

  1991cited by this paper
• On the Composition of Zero-Knowledge Proof Systems

  1990cited by this paper
• One-way functions are necessary and sufficient for secure signatures

  1990cited by this paper
• Noninteractive Zero-Knowledge

  1990cited by this paper
• Multiple non-interactive zero knowledge proofs based on a single random string

  1990cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• A hard-core predicate for all one-way functions

  1989cited by this paper
• Universal one-way hash functions and their cryptographic applications

  1989influential reference
• New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs

  1989cited by this paper
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole

  1988cited by this paper
• Non-interactive zero-knowledge and its applications

  1988cited by this paper
• How to sign given any trapdoor function

  1988cited by this paper
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

  1988cited by this paper
• Non-Interactive Zero-Knowledge Proof Systems

  1987influential reference
• Random self-reducibility and zero knowledge interactive proofs of possession of information

  1987cited by this paper
• One way functions and pseudorandom generators

  1987cited by this paper
• How to construct random functions

  1986cited by this paper
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

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

  1986cited by this paper
• Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview

  1986cited by this paper
• One-way functions and pseudorandom generators

  1985influential reference
• Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game

  1985cited by this paper
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information

  1985cited by this paper
• Probabilistic Encryption

  1984influential reference
• Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game (Extended Abstract)

  1984influential reference
• Theory and Applications of Trapdoor Functions (Extended Abstract)

  1982cited by this paper
• Why and how to establish a private code on a public network

  1982cited by this paper
• DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

  1979cited by this paper
• A method for obtaining digital signatures and public-key cryptosystems

  1978cited by this paper
• Hiding information and signatures in trapdoor knapsacks

  1978influential reference
• New Directions in Cryptography

  1976influential reference

• Improved Rate for Non-Malleable Codes and Time-Lock Puzzles

  2026cites this paper
• Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding

  2026influential citation
• Timed Commitments and Timed Encryption: Generic Constructions and Instantiations from Isogenies

  2026cites this paper
• Strengthening RSA Encryption via Hybrid Cryptosystem and Key Management

  2025cites this paper
• Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments

  2025cites this paper
• Post-quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich's LPN

  2025cites this paper
• Secure and efficient fully dynamic group signature based on RSIS and RLWE

  2025cites this paper
• Bilateral Control for Secure Communication Against Replay Attack in ORAN-Based Vehicular Networks

  2025cites this paper
• Quantum CCA-Secure PKE, Revisited

  2025cites this paper
• A new construction of keyed-FHE without zk-SNARK for homomorphic evaluation

  2025cites this paper
• Improved Constant-Sized Polynomial Commitment Schemes Without Trusted Setup

  2025cites this paper
• Intermundium-DL: Assessing the Resilience of Current Schemes to Discrete-Log-Computation Attacks on Public Parameters

  2025cites this paper
• IND-CPAC: A New Security Notion for Conditional Decryption in Fully Homomorphic Encryption

  2025cites this paper
• Everlasting Fully Dynamic Group Signatures

  2025cites this paper
• Generic PVSS Framework with O(1) Complexity Using CCA2-Secure Threshold Encryption

  2025cites this paper
• A Code-Based Anonymous Authentication Scheme for Vehicular Ad Hoc Networks

  2025cites this paper
• Lattice-Based Group Signatures in the Standard Model, Revisited

  2025cites this paper
• Dynamic Threshold Key Encapsulation With Transparent Setup

  2025cites this paper
• Certified-Everlasting Quantum NIZK Proofs

  2025cites this paper
• Adaptive TDF from any TDF via Pseudorandom-Ciphertext PKE

  2025cites this paper
• Anamorphic-Resistant Encryption; Or Why the Encryption Debate is Still Alive

  2025cites this paper
• Termite Attacks: Gnawing on Logs to Extract Secret Information

  2025cites this paper
• ZHE: Efficient Zero-Knowledge Proofs for HE Evaluations

  2025cites this paper
• CCA-Secure Traceable Threshold (ID-based) Encryption and Application

  2025cites this paper
• On Quantum Simulation-Soundness

  2025cites this paper
• Deny Whatever You Want: Dual-Deniable Public-Key Encryption

  2025cites this paper
• Pilvi: Lattice Threshold PKE with Small Decryption Shares and Improved Security

  2025cites this paper
• Relations among new CCA security notions for approximate FHE

  2025cites this paper
• Direct Range Proofs for Paillier Cryptosystem and Their Applications

  2024cites this paper
• GAPP: Generic Aggregation of Polynomial Protocols

  2024cites this paper
• Code-Based Zero-Knowledge from VOLE-in-the-Head and Their Applications: Simpler, Faster, and Smaller

  2024cites this paper
• Straight-Line Knowledge Extraction for Multi-Round Protocols

  2024cites this paper
• Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting

  2024cites this paper
• Observational equivalence and security games: Enhancing the formal analysis of security protocols

  2024cites this paper
• A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors

  2024cites this paper
• Beyond selective disclosure: Extending distributed p-ABC implementations by commit-and-prove techniques

  2024cites this paper
• Using Predicate Extension for Predicate Encryption to Generically Obtain Chosen-Ciphertext Security and Signatures

  2024cites this paper
• Leveraging Small Message Spaces for CCA1 Security in Additively Homomorphic and BGN-type Encryption

  2024cites this paper
• Kleptographic Attacks against Implicit Rejection

  2024cites this paper
• Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes

  2024cites this paper
• Revocable ring signatures with CCA-anonymity from standard lattices

  2024cites this paper
• Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond

  2024cites this paper
• Efficient code-based fully dynamic group signature scheme

  2024cites this paper
• Cryptographically Assured Information Flow: Assured Remote Execution

  2024cites this paper
• Rate-1 Statistical Non-Interactive Zero-Knowledge

  2024cites this paper
• Non-interactive Zero-Knowledge from LPN and MQ

  2024cites this paper
• Fully Homomorphic Encryption beyond IND-CCA1 Security: Integrity through Verifiability

  2024cites this paper
• Fine-Grained and Sanitizable Access Control Service for IoT-Based Digital Subscriptions

  2024cites this paper
• On the plausibility of simulation based security in Multi Key Searchable Encryption with short share keys

  2024cites this paper
• Group Encryption: Full Dynamicity, Message Filtering and Code-Based Instantiation

  2024cites this paper
• EagleSignV3 : A new secure variant of EagleSign signature over lattices

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

  2023cites this paper
• Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing

  2023cites this paper
• Security with Functional Re-Encryption from CPA

  2023cites this paper
• Identity-Based Matchmaking Encryption, Revisited: Strong Security and Practical Constructions from Standard Classical and Post-Quantum Assumptions

  2023cites this paper
• Sender-Anamorphic Encryption Reformulated: Achieving Robust and Generic Constructions

  2023cites this paper
• “Someone Definitely Used 0000”: Strategies, Performance, and User Perception of Novice Smartphone-Unlock PIN-Guessers

  2023cites this paper
• Efficient Updatable Public-Key Encryption from Lattices

  2023cites this paper
• Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA

  2023cites this paper
• Updatable Public Key Encryption with Strong CCA Security: Security Analysis and Efficient Generic Construction

  2023cites this paper
• DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing More

  2023cites this paper
• Generic constructions of master-key KDM secure attribute-based encryption

  2023cites this paper
• Batch Arguments to NIZKs from One-Way Functions

  2023cites this paper
• SoK: Public Key Encryption with Openings

  2023cites this paper
• Sigma Protocols from Verifiable Secret Sharing and Their Applications

  2023cites this paper
• Anamorphic Signatures: Secrecy From a Dictator Who Only Permits Authentication!

  2023cites this paper
• A Note on Non-Interactive Zero-Knowledge from CDH

  2023cites this paper
• Private Coin Verifiable Delay Function

  2023cites this paper
• Threshold Cryptosystems Based on 2k-th Power Residue Symbols

  2023influential citation
• Lattice-based Authenticated Key Exchange with Tight Security

  2023cites this paper
• Fine-Grained Verifier NIZK and Its Applications

  2023cites this paper
• Alternative Constructions of Asymmetric Primitives from Obfuscation: Hierarchical IBE, Predicate Encryption, and More

  2023cites this paper
• A Generic Transform from Multi-Round Interactive Proof to NIZK

  2023cites this paper
• NIZK from SNARGs

  2023cites this paper
• The Self-Anti-Censorship Nature of Encryption: On the Prevalence of Anamorphic Cryptography

  2023cites this paper
• A survey of quantum secure group signature schemes: Lattice-based approach

  2023cites this paper
• How To Bind A TPM's Attestation Keys With Its Endorsement Key

  2023cites this paper
• Deniable Authentication when Signing Keys Leak

  2023cites this paper
• SoK: Towards CCA Secure Fully Homomorphic Encryption

  2023cites this paper
• vFHE: Verifiable Fully Homomorphic Encryption

  2023cites this paper
• SYSTEMS AND METHODS OF INFORMATION PROTECTION

  2023cites this paper
• (Inner-Product) Functional Encryption with Updatable Ciphertexts

  2023cites this paper
• A Review of Cyber Security Threats in Internet of Things

  2023cites this paper
• Rinocchio: SNARKs for Ring Arithmetic

  2023cites this paper
• Chosen Ciphertext Security via BARGs

  2023influential citation
• Anamorphic Encryption: Private Communication Against a Dictator

  2022influential citation
• COA-Secure Obfuscation and Applications

  2022cites this paper
• NIWI and New Notions of Extraction for Algebraic Languages

  2022cites this paper
• Dew: Transparent Constant-sized zkSNARKs

  2022cites this paper
• Lattice-based group encryptions with only one trapdoor

  2022cites this paper
• Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience

  2022cites this paper
• A survey on Attribute-Based Signatures

  2022cites this paper
• Keyed-Fully Homomorphic Encryption without Indistinguishability Obfuscation

  2022influential citation
• Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning

  2022cites this paper
• Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model

  2022cites this paper
• On the IND-CCA1 Security of FHE Schemes

  2022cites this paper
• Multi-Designated Receiver Signed Public Key Encryption

  2022cites this paper
• Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts

  2022cites this paper
• Practical Integrity Protection for Private Computations

  2022cites this paper
• Boosting CPA to CCA2 for Leakage-Resilient Attribute-Based Encryption by Using New QA-NIZK

  2022cites this paper