Pages that link to "Item:Q1678369"
From MaRDI portal
The following pages link to Distinguisher-dependent simulation in two rounds and its applications (Q1678369):
Displaying 27 items.
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Statistical witness indistinguishability (and more) in two messages (Q1653073) (← links)
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions (Q1701448) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Individual simulations (Q2691606) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Cryptographic group actions and applications (Q2692390) (← 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)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Implementation of photon partial distinguishability in a quantum optical circuit simulation (Q6162908) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Weak zero-knowledge via the Goldreich-Levin theorem (Q6562563) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
- Malicious security for SCALES. Outsourced computation with ephemeral servers (Q6653038) (← links)
