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

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, No-signaling linear PCPs, 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, The design and evolution of OCB, Deterministic public-key encryption for adaptively-chosen plaintext distributions, On the (im-)possibility of extending coin toss, Novel $\Omega$-protocols for NP, Sound and complete computational interpretation of symbolic hashes in the standard model, Simpler session-key generation from short random passwords, Privacy-preserving restricted Boltzmann machine, Obfuscation for cryptographic purposes, Bounds on the efficiency of black-box commitment schemes, Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?, Protecting against key-exposure: strongly key-insulated encryption with optimal threshold, Secure and efficient multiparty private set intersection cardinality, Non-Interactive Zero-Knowledge Proofs of Non-Membership, Linearly Homomorphic Encryption from $$\mathsf {DDH}$$, The eleventh power residue symbol, Non-malleability Under Selective Opening Attacks: Implication and Separation, Non-Malleable Encryption: Simpler, Shorter, Stronger, Cryptographic Assumptions: A Position Paper, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, Privacy preserving anomaly detection based on local density estimation, Secure ElGamal-Type Cryptosystems Without Message Encoding, Security Analysis of the Modular Enhanced Symmetric Role Authentication (mERA) Protocol, A unified approach to deterministic encryption: new constructions and a connection to computational entropy, Bit Security of the CDH Problems over Finite Fields, Cryptanalysis of a new image alternate encryption algorithm based on chaotic map, Content-Based Encryption, On the security of homomorphic encryption on approximate numbers, An improvement of multi-exponentiation with encrypted bases argument: smaller and faster, Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, On privacy preserving data release of linear dynamic networks, Deterministic Public-Key Encryption Under Continual Leakage, Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks, Universal proxy re-encryption, On the CCA compatibility of public-key infrastructure, Naor-Yung Paradigm with Shared Randomness and Applications, Bounded Size-Hiding Private Set Intersection, Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE, Quantum Homomorphic Encryption for Polynomial-Sized Circuits, Semantic Security and Indistinguishability in the Quantum World, Strong Forward Security in Identity-Based Signcryption, Quantum encryption and generalized Shannon impossibility, Signcryption with non-interactive non-repudiation, Handling adaptive compromise for practical encryption schemes, Verifiable registration-based encryption, Fully deniable interactive encryption, Chosen ciphertext security from injective trapdoor functions, A performance evaluation of pairing-based broadcast encryption systems, Public-key cryptography and invariant theory, On non-Abelian homomorphic public-key cryptosystems, Formal security proofs with minimal fuss: implicit computational complexity at work, Anonymous protocols: notions and equivalence, Collision-resistant and pseudorandom function based on Merkle-Damgård hash function, Explicit Randomness is not Necessary when Modeling Probabilistic Encryption, Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions, Little extension of Euler's criterion for quadratic residue, Succinct non-interactive secure computation, 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, More on average case vs approximation complexity, Provably-secure time-bound hierarchical key assignment schemes, Discrete logarithm based additively homomorphic encryption and secure data aggregation, A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects, Quantum cryptography beyond quantum key distribution, Efficient set operations in the presence of malicious adversaries, Computational indistinguishability between quantum states and its cryptographic application, A note on computational indistinguishability, An efficient probabilistic encryption scheme, Secure circuit evaluation. A protocol based on hiding information from an oracle, Leakage-resilient cryptography from puncturable primitives and obfuscation, Homomorphic secret sharing for low degree polynomials, Short undeniable signatures based on group homomorphisms, Lossy trapdoor functions from homomorphic reproducible encryption, An efficient IND-CCA2 secure Paillier-based cryptosystem, Cryptographic transformations of non-Shannon sources of information, Cloud computing in cryptography and steganography, Securely obfuscating re-encryption, Timed encryption with application to deniable key exchange, Practic zero-knowledge proofs: Giving hints and using deficiencies, Security proof of the canonical form of self-synchronizing stream ciphers, Incremental deterministic public-key encryption, A black-box construction of non-malleable encryption from semantically secure encryption, A full proof of the BGW protocol for perfectly secure multiparty computation, A new framework for the design and analysis of identity-based identification schemes, Robust encryption, A uniform-complexity treatment of encryption and zero-knowledge, On the security of public key cryptosystems with a double decryption mechanism, (Leveled) Fully Homomorphic Encryption without Bootstrapping, Efficient provably-secure hierarchical key assignment schemes, Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs, $k$-anonymous data collection, On the freedom of decryption, Semantic security for the McEliece cryptosystem without random oracles, Efficient public key encryption with smallest ciphertext expansion from factoring, Key-dependent message security: generic amplification and completeness, Better security for deterministic public-key encryption: the auxiliary-input setting, On the communication complexity of zero-knowledge proofs, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, Computationally sound implementations of equational theories against passive adversaries, Private multiparty sampling and approximation of vector combinations, Authenticated encryption: relations among notions and analysis of the generic composition paradigm, Some consequences of the existnce of pseudorandom generators, Cryptography with constant input locality, New approaches for deniable authentication, Synthesizers and their application to the parallel construction of pseudo-random functions, Entropic security in quantum cryptography, Secure distributed storage and retrieval, Insight of the protection for data security under selective opening attacks, Variations on a theme by Akl and Taylor: security and tradeoffs, On the limits of nonapproximability of lattice problems, An application of index forms in cryptography, New efficient and secure protocols for verifiable signature sharing and other applications, The discrete logarithm modulo a composite hides $O(n)$ bits, Pseudorandom bits for constant depth circuits, The design of a secure and fair sealed-bid auction service, Definitions and properties of zero-knowledge proof systems, Public key cryptography based on ergodic matrices over finite field, An information-theoretic treatment of random-self-reducibility, Probabilistic proof systems — A survey, On Applicative Similarity, Sequentiality, and Full Abstraction, All Bits in ax + b mod p are Hard, Robust and Efficient Sharing of RSA Functions, Short Integrated PKE+PEKS in Standard Model, Group-Based Source-Destination Verifiable Encryption with Blacklist Checking, Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions, Simultaneous Secrecy and Reliability Amplification for a General Channel Model, Approximate-Deterministic Public Key Encryption from Hard Learning Problems, Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity, Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations, Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants, Provable security of digital signatures in the tamper-proof device model, Communication Lower Bounds via Critical Block Sensitivity, Semantic Security and Key-Privacy with Random Split of St-Gen Codes, A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security, On the Impossibility of Strong Encryption Over $\aleph_0$, On characterizations of escrow encryption schemes, Methodology for assessing the security of cryptographic protocols, How to Leak a Secret and Reap the Rewards Too, Gambling, Computational Information and Encryption Security, Mechanism design and communication networks, Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions, Computational Security of Quantum Encryption, Almost Perfect Privacy for Additive Gaussian Privacy Filters, An Approach for Symmetric Encryption Against Side Channel Attacks in Provable Security, Formal Security Treatments for Signatures from Identity-Based Encryption, Secure Implementation of Asynchronous Method Calls and Futures, A Brief History of Provably-Secure Public-Key Encryption, A Double Perturbation Method for Reducing Dynamical Degradation of the Digital Baker Map, How to Encrypt with the LPN Problem, Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves, Metric Reasoning About $$\lambda $$-Terms: The General Case, Two Generic Constructions of Probabilistic Cryptosystems and Their Applications, Linear Bandwidth Naccache-Stern Encryption, Homomorphic Encryptions of Sums of Groups, Cryptography and cryptographic protocols, Secure and efficient off-line digital money (extended abstract), Signcryption Schemes Based on the Diffie–Hellman Problem, Efficient message transmission via twisted Edwards curves, Sliding encryption: A cryptographic tool for mobile agents, Practical Order-Revealing Encryption with Limited Leakage, Design of strong cryptographic schemes based on Latin Squares, ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM, An applications of signed quadratic residues in public key cryptography, Functional Encryption: Origins and Recent Developments, On the Semantic Security of Functional Encryption Schemes, IMPROVEMENT OF ONE QUANTUM ENCRYPTION SCHEME, A Calculus for Game-Based Security Proofs, Language Modeling and Encryption on Packet Switched Networks, A Provable-Security Treatment of the Key-Wrap Problem, The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs, Cryptographic Functions from Worst-Case Complexity Assumptions, Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles, Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption, Chosen Ciphertext Security with Optimal Ciphertext Overhead, OAEP Is Secure under Key-Dependent Messages, One-message statistical Zero-Knowledge Proofs and space-bounded verifier, A Complete Public-Key Cryptosystem, Generic Case Complexity and One-Way Functions, Using Decision Problems in Public Key Cryptography, AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM, Multiple ramp schemes, A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model, Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications, Algebraic cryptography: new constructions and their security against provable break, The Power of Anonymous Veto in Public Discussion, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, Practical Chosen Ciphertext Secure Encryption from Factoring, How much data may be safely processed on one key in different modes?, Application of non-associative structures for construction of homomorphic cryptosystems, Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols, In a World of P=BPP, Three XOR-Lemmas — An Exposition, Randomness and Computation, On Security Preserving Reductions – Revised Terminology, On the Theoretical Gap between Group Signatures with and without Unlinkability, Generalized Learning Problems and Applications to Non-commutative Cryptography, Unnamed Item, Towards Restricting Plaintext Space in Public Key Encryption, Towards Security Notions for White-Box Cryptography, Generic Construction of Stateful Identity Based Encryption, A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys, Attribute-based re-encryption scheme in the standard model, On Constructing Homomorphic Encryption Schemes from Coding Theory, Publicly Verifiable Secret Sharing for Cloud-Based Key Management, Provably secure Rabin-p cryptosystem in hybrid setting, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems, Delayed-Key Message Authentication for Streams, Robust Encryption, The Many Entropies in One-Way Functions, Homomorphic Encryption, How to Simulate It – A Tutorial on the Simulation Proof Technique, A Note on Perfect Correctness by Derandomization, A public key cryptosystem and a signature scheme based on discrete logarithms, Weak Zero-Knowledge beyond the Black-Box Barrier, Initiator-Resilient Universally Composable Key Exchange

Cites Work