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 ⋮ Layout randomization and nondeterminism ⋮ Relations between robustness and RKA security under public-key encryption ⋮ Secrecy types for asymmetric communication. ⋮ The power of adaptiveness and additional queries in random-self- reductions ⋮ The knowledge complexity of quadratic residuosity languages ⋮ Private authentication ⋮ On the Clark-Jacob version of SPLICE/AS ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Hardness vs randomness ⋮ Protecting the privacy of voters: new definitions of ballot secrecy for e-voting ⋮ Linear complexity of the \(x^{2} \bmod p\) orbits ⋮ On secret set schemes ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Certifying trapdoor permutations, revisited ⋮ Tightly secure signatures and public-key encryption ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Toward a game theoretic view of secure computation ⋮ On the bit security of cryptographic primitives ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Partial information in public key cryptography ⋮ One-way permutations in NC 0 ⋮ Deciding knowledge in security protocols under equational theories ⋮ Minimum disclosure proofs of knowledge ⋮ A semantically secure public key cryptoscheme using bit-pair shadows ⋮ Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks ⋮ A thirty year old conjecture about promise problems ⋮ Mathematical problems in cryptology ⋮ Privacy-preserving algorithms for distributed mining of frequent itemsets ⋮ Computational indistinguishability: algorithms vs. circuits ⋮ On server trust in private proxy auctions ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ On the impossibility of cryptography with tamperable randomness ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ The hunting of the SNARK ⋮ Public-coin parallel zero-knowledge for NP

Cites Work

This page was built for publication: Probabilistic encryption