Pages that link to "Item:Q5445524"

The following pages link to The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524):

Displaying 8 items.

• Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
• A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
• On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
• The round complexity of quantum zero-knowledge (Q2695629) (← links)
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
• On Black-Box Complexity of Universally Composable Security in the CRS Model (Q2795971) (← links)
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630) (← links)
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)