Pages that link to "Item:Q4875450"

The following pages link to On the Composition of Zero-Knowledge Proof Systems (Q4875450):

Displaying 24 items.

• The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
• How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
• Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
• Cryptography and cryptographic protocols (Q5138490) (← links)
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
• Mathematical Foundations of Computer Science 2004 (Q5311111) (← links)
• An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)
• The Complexity of Zero Knowledge (Q5458822) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
• On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
• Constructing tree decompositions of graphs with bounded gonality (Q5918255) (← links)
• Parallel and concurrent security of the HB and \(HB^{+}\) protocols (Q5962225) (← links)
• (Q6084353) (← links)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
• Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
• Post-quantum insecurity from LWE (Q6169346) (← links)
• Threshold secret sharing with geometric algebras (Q6496087) (← links)
• Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
• Universality of graph homomorphism games and the quantum coloring problem (Q6617160) (← links)
• Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)