Pages that link to "Item:Q4785630"
From MaRDI portal
The following pages link to Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630):
Displaying 14 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions (Q3457061) (← links)
- Parallel and Concurrent Security of the HB and HB + Protocols (Q3593090) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)
- Automata, Languages and Programming (Q5716776) (← links)
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols (Q5962225) (← links)
