Two Halves Make a Whole
From MaRDI portal
Publication:2948384
DOI10.1007/978-3-662-46803-6_8zbMath1371.94662MaRDI 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
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, High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority, Block cipher invariants as eigenvectors of correlation matrices, 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, 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, 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), Fast garbling of circuits under standard assumptions, 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, How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes, Cross and Clean: Amortized Garbled Circuits with Constant Overhead
