The IPS Compiler: Optimizations, Variants and Concrete Efficiency

DOI10.1007/978-3-642-22792-9_15zbMath1288.68023OpenAlexW2163481970MaRDI QIDQ5199196

Eli Oxman, Yehuda Lindell, Benny Pinkas

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_15

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Distributed systems (68M14) Network protocols (68M12)

Related Items (14)

Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Generalizing Efficient Multiparty Computation ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Scalable Multi-party Private Set-Intersection ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Practical Attack on 8 Rounds of the Lightweight Block Cipher KLEIN ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ The price of active security in cryptographic protocols

This page was built for publication: The IPS Compiler: Optimizations, Variants and Concrete Efficiency