Pages that link to "Item:Q1753863"
From MaRDI portal
The following pages link to Efficient adaptively secure zero-knowledge from garbled circuits (Q1753863):
Displaying 17 items.
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Adaptive garbled RAM from laconic oblivious transfer (Q775994) (← links)
- Adaptively secure garbling with near optimal online complexity (Q1648850) (← links)
- Privacy-free garbled circuits for formulas: size zero and information-theoretic (Q1675725) (← links)
- (Commit-and-prove) predictable arguments with privacy (Q2096627) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer (Q3611766) (← links)
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing (Q4911582) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- GUC-secure commitments via random oracles: new impossibility and feasibility (Q6175972) (← links)
- A new approach to garbled circuits (Q6535139) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols (Q6660381) (← links)
- Round efficient Byzantine agreement from VDFs (Q6660385) (← links)
