The following pages link to Probabilistic encryption (Q1057832):
Displayed 50 items.
- On the freedom of decryption (Q1007641) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Efficient public key encryption with smallest ciphertext expansion from factoring (Q1009067) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm (Q1021246) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Entropic security in quantum cryptography (Q1039614) (← links)
- Variations on a theme by Akl and Taylor: security and tradeoffs (Q1041239) (← links)
- An application of index forms in cryptography (Q1046753) (← links)
- Partial information in public key cryptography (Q1105565) (← links)
- One-way permutations in NC 0 (Q1108786) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Computational indistinguishability: algorithms vs. circuits (Q1127328) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- Hardness vs randomness (Q1337458) (← links)
- Dynamical analysis of a class of Euclidean algorithms. (Q1401315) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- New efficient and secure protocols for verifiable signature sharing and other applications (Q1582011) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects (Q1703553) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← links)
- Robust encryption (Q1753165) (← links)
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs (Q1791668) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Secrecy types for asymmetric communication. (Q1874278) (← links)
- Private authentication (Q1881255) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)