The IPS compiler: optimizations, variants and concrete efficiency
From MaRDI portal
Publication:5199196
Recommendations
- Round-optimal black-box protocol compilers
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Cited in
(15)- Efficient, actively secure MPC with a dishonest majority: a survey
- Scalable multi-party private set-intersection
- On the complexity of additively homomorphic UC commitments
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- The price of active security in cryptographic protocols
- High-performance multi-party computation for binary circuits based on oblivious transfer
- More efficient constant-round multi-party computation from BMR and SHE
- Generic compiler for publicly verifiable covert multi-party computation
- Black-box transformations from passive to covert security with public verifiability
- The price of active security in cryptographic protocols
- Generalizing efficient multiparty computation
- Practical attack on 8 rounds of the lightweight block cipher KLEIN
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
This page was built for publication: The IPS compiler: optimizations, variants and concrete efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199196)