Two Halves Make a Whole
From MaRDI portal
Publication:2948384
DOI10.1007/978-3-662-46803-6_8zbMath1371.94662OpenAlexW780859780MaRDI QIDQ2948384
No author found.
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_8
Related Items (56)
Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Practical attacks against the walnut digital signature scheme ⋮ An efficient structural attack on NIST submission DAGS ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Adaptive security of practical garbling schemes ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ \textsc{EpiGRAM}: practical garbled RAM ⋮ Garbled circuits with sublinear evaluator ⋮ Fast garbling of circuits under standard assumptions ⋮ New ways to garble arithmetic circuits ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ High-throughput secure three-party computation with an honest majority ⋮ Authenticated garbling from simple correlations ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Faster Privacy-Preserving Location Proximity Schemes ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ On multiparty garbling of arithmetic circuits ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ A single shuffle is enough for secure card-based computation of any Boolean circuit ⋮ Secure two-party computation in a quantum world ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ On the exact round complexity of secure three-party computation ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation ⋮ Private set operations from oblivious switching ⋮ Network Oblivious Transfer ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ The price of active security in cryptographic protocols
This page was built for publication: Two Halves Make a Whole
