A survey on cryptographic techniques for protecting big data security: present and forthcoming

S Lu, J Zheng, Z Cao, Y Wang, C Gu - Science China Information …, 2022 - Springer
Big data drive multidimensional convergence and profound innovations among industries
and provide novel ways of exploring the world. As they significantly create economic and …

A survey on secure computation based on homomorphic encryption in vehicular ad hoc networks

X Sun, FR Yu, P Zhang, W Xie, X Peng - Sensors, 2020 - mdpi.com
In vehicular ad hoc networks (VANETs), the security and privacy of vehicle data are core
issues. In order to analyze vehicle data, they need to be computed. Encryption is a common …

Two-message statistically sender-private OT from LWE

Z Brakerski, N Döttling - … : 16th International Conference, TCC 2018, Panaji …, 2018 - Springer
We construct a two-message oblivious transfer (OT) protocol without setup that guarantees
statistical privacy for the sender even against malicious receivers. Receiver privacy is game …

Round optimal secure multiparty computation from minimal assumptions

A Rai Choudhuri, M Ciampi, V Goyal, A Jain… - Theory of Cryptography …, 2020 - Springer
We construct a four round secure multip arty computation (MPC) protocol in the plain model
that achieves security against any dishonest majority. The security of our protocol relies only …

Promise zero knowledge and its applications to round optimal MPC

S Badrinarayanan, V Goyal, A Jain, YT Kalai… - Annual International …, 2018 - Springer
We devise a new partitioned simulation technique for MPC where the simulator uses
different strategies for simulating the view of aborting adversaries and non-aborting …

[PDF][PDF] Efficient Threshold FHE for Privacy-Preserving Applications

S Chowdhury, S Sinha, A Singh, S Mishra… - Cryptology ePrint …, 2022 - iacr.steepath.eu
Abstract Threshold Fully Homomorphic Encryption (ThFHE) enables arbitrary computation
over encrypted data while keeping the decryption key distributed across multiple parties at …

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

F Benhamouda, H Lin - Advances in Cryptology–EUROCRYPT 2018: 37th …, 2018 - Springer
We present new constructions of round-efficient, or even round-optimal, Multi-Party
Computation (MPC) protocols from Oblivious Transfer (OT) protocols. Our constructions …

Round-optimal secure multi-party computation

S Halevi, C Hazay, A Polychroniadou… - Journal of …, 2021 - Springer
Secure multi-party computation (MPC) is a central cryptographic task that allows a set of
mutually distrustful parties to jointly compute some function of their private inputs where …

Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles

H Lin, R Pass, P Soni - SIAM Journal on Computing, 2020 - SIAM
Non-malleable commitments are a fundamental cryptographic tool for preventing
(concurrent) man-in-the-middle attacks. Since their invention by Dolev, Dwork, and Naor in …

A new approach to round-optimal secure multiparty computation

P Ananth, AR Choudhuri, A Jain - … , Santa Barbara, CA, USA, August 20 …, 2017 - Springer
We present a new approach towards constructing round-optimal secure multiparty
computation (MPC) protocols against malicious adversaries without trusted setup …