The following pages link to (Q4440437):
Displaying 9 items.
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Input-oblivious proof systems and a uniform complexity perspective on P/poly (Q2828212) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Impossibility results for recycling random bits in two-prover proof systems (Q4234094) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428127) (← links)
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence (Q6061982) (← links)
