Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
From MaRDI portal
Publication:2798800
DOI10.1007/978-3-662-49387-8_9zbMath1395.94279MaRDI QIDQ2798800
Vanishree Rao, Antigoni Polychroniadou, Ivan B. Damgård
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49387-8_9
94A60: Cryptography
Related Items
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, Adaptively secure MPC with sublinear communication complexity, Two-round adaptively secure multiparty computation from standard assumptions, The polynomial learning with errors problem and the smearing condition, Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit, On Adaptively Secure Multiparty Computation with a Short CRS, More Efficient Constant-Round Multi-party Computation from BMR and SHE