JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes

Zhu, Ruiyu; Huang, Yan

doi:10.1007/978-3-319-70697-9_19

Cited by 12 publications

(3 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second one is the gate-level C&C approach that was introduced by Nielsen and Orlandi [225] and called LEGO, where a lot of individual garbled AND gates are prepared, a random subset of them are opened and verified, and the remaining unchecked garbled gates are soldered to a garbled fault tolerant circuit using the XOR-homomorphic commitments. Subsequently, the LEGO protocol was optimized in [226][227][228][229][230][231]. Compared to the circuit-level C&C approach, the gate-level C&C approach has a lower asymptotic complexity O(ρ/ log |C|) and supports the function-independent preprocessing where both circuit and input are unknown (where such preprocessing is not supported by the circuit-level C&C approach), but is less efficient in the amortized setting and has also lower efficiency for some functions in the single-execution setting.…”

Section: Secure Two-party Computationmentioning

confidence: 99%

Concretely efficient secure multi-party computation protocols: survey and more

Feng

Yang

2022

Security and Safety

View full text Add to dashboard Cite

Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on their private inputs, and reveals nothing but the output of the function. In the last decade, MPC has rapidly moved from a purely theoretical study to an object of practical interest, with a growing interest in practical applications such as privacy-preserving machine learning (PPML). In this paper, we comprehensively survey existing work on concretely efficient MPC protocols with both semi-honest and malicious security, in both dishonest-majority and honest-majority settings. We focus on considering the notion of security with abort, meaning that corrupted parties could prevent honest parties from receiving output after they receive output. We present high-level ideas of the basic and key approaches for designing different styles of MPC protocols and the crucial building blocks of MPC. For MPC applications, we compare the known PPML protocols built on MPC, and describe the efficiency of private inference and training for the state-of-the-art PPML protocols. Furthermore, we summarize several challenges and open problems to break though the efficiency of MPC protocols as well as some interesting future work that is worth being addressed. This survey aims to provide the recent development and key approaches of MPC to researchers, who are interested in knowing, improving, and applying concretely efficient MPC protocols.

show abstract

Section: Secure Two-party Computationmentioning

confidence: 99%

Concretely efficient secure multi-party computation protocols: survey and more

Feng

Yang

2022

Security and Safety

View full text Add to dashboard Cite

show abstract

“…They then instantiate H as H(x, i) = π(2x ⊕ i) ⊕ 2x ⊕ i, and claim without proof that this satisfies their definition. 5 Zhu et al [54] used a customized garbling scheme with the hash function instantiated as H(x, i) = π(x ⊕ i) ⊕ x ⊕ i. Since the garbling scheme of Zhu et al incorporates the free-XOR optimization [31], a proof of security requires H to satisfy a notion of circular correlation robustness [14].…”

Section: B Garblingmentioning

confidence: 99%

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers

Guo

Katz

Wang³

et al. 2020

2020 IEEE Symposium on Security and Privacy (SP)

View full text Add to dashboard Cite

Many implementations of secure computation use fixed-key AES (modeled as a random permutation); this results in substantial performance benefits due to existing hardware support for AES and the ability to avoid recomputing the AES key schedule. Surveying these implementations, however, we find that most utilize AES in a heuristic fashion; in the best case this leaves a gap in the security proof, but in many cases we show it allows for explicit attacks.Motivated by this unsatisfactory state of affairs, we initiate a comprehensive study of how to use fixed-key block ciphers for secure computation-in particular for OT extension and circuit garbling-efficiently and securely. Specifically:• We consider several notions of pseudorandomness for hash functions (e.g., correlation robustness), and show provably secure schemes for OT extension, garbling, and other applications based on hash functions satisfying these notions. • We provide provably secure constructions, in the (nonprogrammable) random-permutation model, of hash functions satisfying the different notions of pseudorandomness we consider. Taken together, our results provide end-to-end security proofs for implementations of secure-computation protocols based on fixedkey block ciphers (modeled as random permutations). Perhaps surprisingly, at the same time our work also results in noticeable performance improvements over the state-of-the-art.

show abstract

“…Roughly speaking, it requires the garbler to generate a bunch of garbled circuit and sends to the evaluator, the evaluator checks the correctness of some garbled circuits and evaluates the others. Although this solution has been optimized through the works [4], [5], the replication factor of the garbled circuits is at least 2 [6].…”

mentioning

confidence: 99%

Maliciously Secure MPC From Semi-Honest 2PC in the Server-Aided Model

Lu,

Zhang,

Ren

2024

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Secure multi-party computation (MPC) provides provable security guarantees for many privacy critical applications. The semi-honest MPC protocols are secure against semi-honest adversaries who can only observe the protocol execution, while the maliciously secure MPC protocols are secure against malicious adversaries who can deviate from the protocol description arbitrarily. Many security sensitive applications tend to use semi-honest MPC protocols because malicious security comes with huge communication and/or computation costs. In this work, we show how to e iciently transform generic semi-honest two-party protocols into maliciously secure multi-party protocol in the server-aided se ing. We further propose an optimized constant-round server-aided MPC protocol. The proposed protocols are secure when all but one parties are maliciously corrupted, while the remaining party and the server are corrupted by semi-honest and non-colluding adversaries. We implement and evaluate our constant-round protocol. For the 2-party case, our protocol is only 1.11× slower than the semi-honest Yao's Garbled Circuits protocol, and it is 9.16× faster than the maliciously secure authenticated garbling protocol and 4.96× faster than the state-of-the-art maliciously secure server-aided protocol of Wu et al. For the 8-party case, our protocol is 103.29× faster than the authenticated garbling protocol and 17.03× faster than the protocol of Wu et al.

show abstract

JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes

Cited by 12 publications

References 41 publications

Concretely efficient secure multi-party computation protocols: survey and more

Concretely efficient secure multi-party computation protocols: survey and more

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers

Maliciously Secure MPC From Semi-Honest 2PC in the Server-Aided Model

Contact Info

Product

Resources

About