Pages that link to "Item:Q3519525"
From MaRDI portal
The following pages link to Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525):
Displaying 50 items.
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- On the decision tree complexity of threshold functions (Q2095465) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← 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)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Optimizing registration based encryption (Q2149790) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Differential uniformity and linearity of S-boxes by multiplicative complexity (Q2154885) (← links)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- New cryptanalysis of LowMC with algebraic techniques (Q2701509) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
