UC-Secure OT from LWE, Revisited

Quach, Willy

doi:10.1007/978-3-030-57990-6_10

Cited by 20 publications

(46 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some lattice-based oblivious transfer protocols are proposed in postquantum era; most of these protocols are based on LWE's assumption under the semihonest, malicious, or covert adversary model [7][8][9]. In 2020, Quach [10] proposed a UC-secure OT protocol based on LWE's assumption and rounding function, which can be seen as a modified framework of PVW-OT, called WQ-OT. In WQ-OT protocol, the rounding function is applied on constructing UC-OT.…”

Section: Related Referencementioning

confidence: 99%

“…Apply the WQ-OT scheme [10] for our CCOT's construction. WQ-OT is a two-round UC-OT based on Common References String (crs), and it is based on LWE assumption with subexponential modulus-to-noise ratio.…”

Section: Dual-mode Wq-pke and Related Wq-ot Protocolmentioning

confidence: 99%

“…(2) Indistinguishability between Messy mode and Dec mode: given string crs to any adversary, adversary cannot distinguish between the Messy mode with the Dec mode, implying Lemma 4 (see [10]). Given LWE q,λ,n assumption with the corresponding parameter in WQ-OT's construction, an dual-mode UC-secure oblivious transfer protocol under static corruption exists.…”

Section: Wq-ot Frameworkmentioning

confidence: 99%

“…(i) We construct a CCOT protocol based on LWE's assumption and rounding function. Applying WQ-OT[10] encryption scheme based on the rounding function and combining with PVW's dual framework[5], we design a UC-secure cut-and-choose OT protocol under the malicious adversary model.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Postquantum Cut-and-Choose Oblivious Transfer Protocol Based on LWE

Hangchao

Han

2021

Security and Communication Networks

View full text Add to dashboard Cite

We propose postquantum universal composable (UC) cut-and-choose oblivious transfer (CCOT) protocol under the malicious adversary model. In secure two-party computation, we construct s copies’ garbled circuits, including half check circuit and half evaluation circuit. The sender can transfer the key to the receiver by CCOT protocol. Compared to PVW-OT [6] framework, we invoke WQ-OT [35] framework with reusability of common random string ( crs ) and better security. Relying on LWE’s assumption and the property of the Rounding function, we construct an UC-CCOT protocol, which can resist quantum attack in secure two-party computation.

show abstract

Section: Related Referencementioning

confidence: 99%

Section: Dual-mode Wq-pke and Related Wq-ot Protocolmentioning

confidence: 99%

Section: Wq-ot Frameworkmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Postquantum Cut-and-Choose Oblivious Transfer Protocol Based on LWE

Hangchao

Han

2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…The LWE-based construction of [PVW08] does not suffice for our purpose since a CRS can be reused only bounded times in their construction. Recently, Quach [Qua20] resolved this issue, and proposed an efficient fully-simulatable 1-out-of-2 oblivious transfer based on the LWE assumption. 4 We can extend his construction to a fully-simulatable 1-out-of-N oblivious transfer efficiently.…”

Section: Technical Overviewmentioning

confidence: 99%

Classically Verifiable NIZK for QMA with Preprocessing

Morimae

Yamakawa²

2021

Preprint

View full text Add to dashboard Cite

We propose three constructions of classically verifiable non-interactive proofs (CV-NIP) and non-interactive zero-knowledge proofs and arguments (CV-NIZK) for QMA in various preprocessing models.1. We construct an information theoretically sound CV-NIP for QMA in the secret parameter model where a trusted party generates a quantum proving key and classical verification key and gives them to the corresponding parties while keeping it secret from the other party. Alternatively, we can think of the protocol as one in a model where the verifier sends an instance-independent quantum message to the prover as preprocessing.2. We construct a CV-NIZK for QMA in the secret parameter model. It is information theoretically sound and zero-knowledge.3. Assuming the quantum hardness of the leaning with errors problem, we construct a CV-NIZK for QMA in a model where a trusted party generates a CRS and the verifier sends an instance-independent quantum message to the prover as preprocessing. This model is the same as one considered in the recent work by Coladangelo, Vidick, and Zhang (CRYPTO '20). Our construction has the so-called dual-mode property, which means that there are two computationally indistinguishable modes of generating CRS, and we have information theoretical soundness in one mode and information theoretical zero-knowledge property in the other. This answers an open problem left by Coladangelo et al, which is to achieve either of soundness or zero-knowledge information theoretically. To the best of our knowledge, ours is the first dual-mode NIZK for QMA in any kind of model.

show abstract

Post‐quantum secure two‐party computing protocols against malicious adversaries

Huo,

Zhao,

Qin

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummarySecure two‐party computation allows a pair of parties to compute a function together while keeping their inputs private. Ultimately, each party receives only its own correct output. In this paper, a post‐quantum secure two‐party computation protocol is proposed that can be used to effectively block malicious parties. The protocol solves the problems of traditional protocols based on garbled circuits, which are vulnerable to quantum attacks, high communication costs and low computational efficiency. The input garbled keys of the circuit constructor is structured as a Learning with Error (LWE) equation, enabling the circuit constructor to employ a zero‐knowledge proof that demonstrates the uniformity of inputs across all circuits.In the key transfer phase, an LWE‐based batch single‐choice cut‐and‐choose oblivious transfer is proposed to avoid selective failure attacks. In addition, the protocol employs a penalty mechanism to detect if the circuit constructor has generated an incorrect circuit. We have compared the communication overhead of this protocol with three other secure two‐party computation protocols based on Cut‐and‐Choose technology. The analytical results show that this protocol has the best error probability and is resilient to quantum attacks under the malicious adversary model. In addition, with appropriate parameters, the protocol is able to reduce its communication bandwidth by an average of 40.41%.

show abstract

UC-Secure OT from LWE, Revisited

Cited by 20 publications

References 20 publications

Postquantum Cut-and-Choose Oblivious Transfer Protocol Based on LWE

Postquantum Cut-and-Choose Oblivious Transfer Protocol Based on LWE

Classically Verifiable NIZK for QMA with Preprocessing

Post‐quantum secure two‐party computing protocols against malicious adversaries

Contact Info

Product

Resources

About