Browse Proceedings

Alon et al. (Crypto 2020) initiated the study of MPC with Friends and Foes (FaF) security, which captures the desirable property that even up to $h^{\ast }$ honest parties should learn nothing additional about other honest parties’ inputs, even if the $t$ ...${}^{}$$\mathrm{}{}^{}$$$$\mathrm{}{}^{}$$$${}^{}$$$${}^{}$

Secure Message Transmission (SMT) is one of the fundamental primitives in secure distributed computing. Consider two nodes $\mathbf{A}$ and $\mathbf{B}$, connected by nnode-disjoint channels, a subset of which may be under the control of a computationally-unbounded ...$\mathbf{}$$\mathbf{}$$\frac{}{\mathrm{}}$$\frac{}{\mathrm{}}$${}_{}\frac{}{\mathrm{}}$${}_{}\frac{}{\mathrm{}}$$\mathrm{}{}_{}{}_{}$${}_{}{}_{}$

Private Simultaneous Messages (PSM) is a minimal model of secure computation, where the input players with shared randomness send messages to the output player simultaneously and only once. In this field, finding upper and lower bounds on ...$\mathrm{}{}_{\mathrm{}}\mathrm{}$$\mathrm{}{}_{\mathrm{}}\mathrm{}$

A secure multiparty computation (MPC) allows several parties to compute a function over their inputs while keeping their inputs private. In its basic setting, the protocol involves only parties that hold inputs. In distributed MPC, there are also ...

We present a new encoder for hiding parameters in an interval membership function. As an application, we design a simple and efficient virtual black-box obfuscator for evasive decision trees. The security of our construction is proved in the ...

Plagiarism is a pressing issue in academia and industry, where individuals often modify existing content without providing due credit to the original creator and unethically claiming the work to be their own. Existing plagiarism detection tools ...

Algorithm hardness can be described by 5 categories: hardness in computation, in sequential computation, in memory, in energy consumption (or bandwidth), in code size. Similarly, hardness can be a concern for solving or for verifying, depending on ...

This paper studies the implementation of the lattice-based PQC on the 32-bit constrained processors that only have constrained multiplication instructions. A typical example of such constrained processors is the ARM Cortex-M0/M0+, which features a ...${\mathrm{}}^{\mathrm{}}$$$$\mathrm{}$

The lattice-based post-quantum cryptosystem NTRU is used by Google for protecting Google’s internal communication. In NTRU, polynomial multiplication is one of bottleneck. In this paper, we explore the interactions between polynomial ...$$$〈{}^{}〉$

Hard lattice problems are predominant in constructing post-quantum cryptosystems. However, we need to continue developing post-quantum cryptosystems based on other quantum hard problems to prevent a complete collapse of post-quantum cryptography ...

Secure boot is a standard feature for ensuring the authentication and integrity of software. For this purpose, secure boot leverages the advantage of Public Key Cryptography (PKC). However, the fast-developing quantum computers have posed serious ...${\mathrm{}}^{\mathit{}}$${}^{}$

Post-Quantum Cryptography (PQC) is one of the most fascinating topics of recent developments in cryptography. Following the ongoing standardization process of PQC by NIST, industry and academia both have been engaged in PQC research with great ...