Probabilistic encryption

DOI10.1016/0022-0000(84)90070-9zbMath0563.94013WikidataQ30051773 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

68Q25: Analysis of algorithms and problem complexity

94A60: Cryptography

Related Items

Multiple ramp schemes, Homomorphic Encryptions of Sums of Groups, Another look at automated theorem-proving, Cryptography and Game Theory: Designing Protocols for Exchanging Information, Towards Key-Dependent Message Security in the Standard Model, Testing problems with sublearning sample complexity, On the statistical properties of Diffie-Hellman distributions, A fair and efficient solution to the socialist millionaires' problem, Pseudorandom generators without the XOR lemma, Pseudorandom bits for constant depth circuits, The design of a secure and fair sealed-bid auction service, Deciding knowledge in security protocols under equational theories, Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks, Privacy-preserving algorithms for distributed mining of frequent itemsets, A note on computational indistinguishability, An efficient probabilistic encryption scheme, Secure circuit evaluation. A protocol based on hiding information from an oracle, Partial information in public key cryptography, One-way permutations in NC 0, Minimum disclosure proofs of knowledge, Computational indistinguishability: algorithms vs. circuits, Practic zero-knowledge proofs: Giving hints and using deficiencies, A uniform-complexity treatment of encryption and zero-knowledge, On the communication complexity of zero-knowledge proofs, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, Synthesizers and their application to the parallel construction of pseudo-random functions, The discrete logarithm modulo a composite hides \(O(n)\) bits, Definitions and properties of zero-knowledge proof systems, The power of adaptiveness and additional queries in random-self- reductions, The knowledge complexity of quadratic residuosity languages, Hardness vs randomness, Dynamical analysis of a class of Euclidean algorithms., Secure distributed storage and retrieval, On the limits of nonapproximability of lattice problems, New efficient and secure protocols for verifiable signature sharing and other applications, Some consequences of the existnce of pseudorandom generators, Secrecy types for asymmetric communication., Private authentication, Fast generation of prime numbers and secure public-key cryptographic parameters., Mathematical problems in cryptology, Computational indistinguishability: A sample hierarchy, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, How to construct secure proxy cryptosystem, Homomorphic public-key cryptosystems and encrypting Boolean circuits, 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, The reactive simulatability (RSIM) framework for asynchronous systems, 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, Protecting against key-exposure: strongly key-insulated encryption with optimal threshold, Signcryption with non-interactive non-repudiation, Public-key cryptography and invariant theory, On non-Abelian homomorphic public-key cryptosystems, Unnamed Item, Public key cryptography based on ergodic matrices over finite field, 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, A public key cryptosystem and a signature scheme based on discrete logarithms

Cites Work