The following pages link to (Q5751927):
Displayed 4 items.
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)