Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority

DOI10.1007/978-3-642-38553-7_15zbMath1312.94114OpenAlexW2189936489MaRDI QIDQ4924688

Isheeta Nargis, Wayne Eberly, Payman Mohassel

Publication date: 7 June 2013

Published in: Progress in Cryptology – AFRICACRYPT 2013 (Search for Journal in Brave)

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

zbMATH Keywords

arithmetic circuithomomorphic encryptionmultiparty computationlossy encryptiondishonest majoritycovert adversary

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

This page was built for publication: Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority