Pages that link to "Item:Q808240"

The following pages link to Constant-round perfect zero-knowledge computationally convincing protocols (Q808240):

Displaying 8 items.

• A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
• Round-optimal perfect zero-knowledge proofs (Q1322120) (← links)
• The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
• Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
• A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
• Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
• On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes (Q6064047) (← links)