The following pages link to Probabilistic encryption (Q1057832):
Displayed 50 items.
- Pseudorandom bits for constant depth circuits (Q808707) (← links)
- The design of a secure and fair sealed-bid auction service (Q814236) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633) (← links)
- A note on computational indistinguishability (Q910218) (← links)
- An efficient probabilistic encryption scheme (Q912074) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← 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)
- 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)
- Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- How to construct secure proxy cryptosystem (Q2384529) (← links)
- Homomorphic public-key cryptosystems and encrypting Boolean circuits (Q2432559) (← links)
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks (Q2456502) (← links)
- Secure distributed constraint satisfaction: reaching agreement without revealing private information (Q2457708) (← links)
- Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics (Q2458101) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold (Q2502164) (← links)
- Signcryption with non-interactive non-repudiation (Q2572979) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- On non-Abelian homomorphic public-key cryptosystems (Q2577587) (← links)
- (Q2741436) (← links)
- Public key cryptography based on ergodic matrices over finite field (Q3443209) (← links)
- Language Modeling and Encryption on Packet Switched Networks (Q3593106) (← links)
- A Provable-Security Treatment of the Key-Wrap Problem (Q3593107) (← links)