Probabilistic encryption

DOI10.1016/0022-0000(84)90070-9zbMath0563.94013OpenAlexW4210300416WikidataQ30051773 ScholiaQ30051773MaRDI QIDQ1057832

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90070-9

zbMATH Keywords

cryptography security implementation probabilistic model of data encryption

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (only showing first 100 items - show all)

Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ On-line/off-line DCR-based homomorphic encryption and applications ⋮ Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ Homomorphic encryption: a mathematical survey ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ PAC privacy: automatic privacy measurement and control of data processing ⋮ One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions ⋮ Cryptography and Digital Transformation ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation ⋮ Lifting standard model reductions to common setup assumptions ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Categorical composable cryptography ⋮ On Privacy Models for RFID ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ Chasing Diagrams in Cryptography ⋮ Testing problems with sublearning sample complexity ⋮ Layout Randomization and Nondeterminism ⋮ On the statistical properties of Diffie-Hellman distributions ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ On the Multi-output Filtering Model and Its Applications ⋮ Quantifying information flow in cryptographic systems ⋮ A fair and efficient solution to the socialist millionaires' problem ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Pseudorandom generators without the XOR lemma ⋮ The truth behind the myth of the folk theorem ⋮ On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption ⋮ No-signaling linear PCPs ⋮ Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions ⋮ Cocks’ Identity-Based Encryption in the Standard Model, via Obfuscation Techniques (Short Paper) ⋮ Development on security models for proxy re-encryption schemes ⋮ Threshold secret sharing with geometric algebras ⋮ A duality between one-way functions and average-case symmetry of information ⋮ NP-hardness of approximating meta-complexity: a cryptographic approach ⋮ Another look at automated theorem-proving ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Round-optimal secure multi-party computation ⋮ No-signaling linear PCPs ⋮ Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions ⋮ Oblivious signature-based envelope ⋮ Towards Key-Dependent Message Security in the Standard Model ⋮ New Anonymity Notions for Identity-Based Encryption ⋮ New Anonymity Notions for Identity-Based Encryption ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function ⋮ Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) ⋮ Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme ⋮ Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem ⋮ A CCA Secure Hybrid Damgård’s ElGamal Encryption ⋮ Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting ⋮ A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol ⋮ A Public-Key Encryption Scheme with Pseudo-random Ciphertexts ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Towards a Theory of Intrusion Detection ⋮ On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) ⋮ MoSS: modular security specifications framework ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption ⋮ On the analysis of cryptographic assumptions in the generic ring model ⋮ More efficient DDH pseudorandom generators ⋮ A note on perfect correctness by derandomization ⋮ Report and trace ring signatures ⋮ How to construct secure proxy cryptosystem ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ CCA secure \textit{a posteriori} openable encryption in the standard model ⋮ Fully leakage-resilient signatures ⋮ Enhancements of trapdoor permutations ⋮ Secret-sharing for NP ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Unnamed Item ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Random algebraic lattices and codes for wireless communications ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Anamorphic encryption: private communication against a dictator ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ On the power of rewinding simulators in functional encryption ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Privacy-preserving Krawtchouk moment feature extraction over encrypted image data ⋮ Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ Universally composable symbolic security analysis ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Secure integration of asymmetric and symmetric encryption schemes ⋮ Homomorphic public-key cryptosystems and encrypting Boolean circuits ⋮ Certain sequence of arithmetic progressions and a new key sharing method ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Security models and proof strategies for plaintext-aware encryption ⋮ Computational indistinguishability: A sample hierarchy ⋮ Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks ⋮ Secure distributed constraint satisfaction: reaching agreement without revealing private information ⋮ Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ The reactive simulatability (RSIM) framework for asynchronous systems

Cites Work

This page was built for publication: Probabilistic encryption