Pages that link to "Item:Q2948383"
From MaRDI portal
The following pages link to Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge (Q2948383):
Displayed 17 items.
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- On Garbling Schemes with and Without Privacy (Q2827734) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- PrORAM (Q6041295) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)