Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation

Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof

Published Jan 1, 2021• 14 citations
Publisher
DOI
10.1007/978-3-030-90453-1_5

Related papers

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation

Ronald Cramer, Ivan Damgård, Yuval Ishai

Lecture notes in computer science•Jan 1, 2005•238 citations

A Coding Scheme for Straggler Resilient Quantum X-Secure T-Private Information Retrieval

Yuxiang Lu, Syed A. Jafar

Building on recent constructions of Quantum Cross Subspace Alignment (QCSA) codes, this work develops a coding scheme for QEXSTPIR, i.e., classical private information retrieval with X -secure storage and$T$-private queries, over a quantum multiple access channel, that is resilient to any set of up to$E$erased servers (equivalently known as unresponsive servers, or stragglers). The scheme is accordingly labeled QECSA, with the ‘$\mathbf{E}$,indicating resilience to erased servers. The novelty of QECSA lies in achieving efficient E-straggler resilience on top of existing QCSA codes that already achieve X-secure storage, T- private queries, and distributed superdense coding gains for communication efficient decoding. The QECSA code structure may be broadly useful for problems such as quantum coded secure distributed computation, where security, straggler resilience, and distributed superdense coding gains are simultaneously required.

International Conference on Communications•Jun 9, 2024•5 citations

Distributed Point Functions and Function Secret Sharing

Elette Boyle, Niv Gilboa, Yuval Ishai +1 more

A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret weight-1 vector (equivalently, a point function) across two or more parties. The appealing lightweight structure of DPF constructions has enabled a wide range of applications. These include private information retrieval, anonymous messaging, secure computation with preprocessing, and pseudorandom correlation generators for expanding small correlated seeds into large pseudorandom instances of cryptographic correlations. In this article, we survey definitions, constructions, and applications of DPFs. We also discuss the extension of DPF to function secret sharing (FSS), which generalizes point functions to support richer function classes. Efficient FSS schemes yield a similar generalization for most of the applications of DPFs.

arXiv:2607.27696•Proceedings of the IEEE•Jan 1, 2026•0 citations

Correlated Pseudorandomness in Secure Computation

Geoffroy Couteau

•Mar 20, 2024•0 citations

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.

Arpita Patra, Ashish Choudhary, Chitra Rangan

Abstract. Verifiable Secret Sharing (VSS) is a fundamental primitive used in many distributed cryptographic tasks, such as Multiparty Computation (MPC) and Byzantine Agreement (BA). It is a two phase (sharing, reconstruction) protocol. The VSS and MPC protocols are carried out among n parties, where t out of n parties can be under the influence of a Byzantine (active) adversary, having unbounded computing power. It is well known that protocols for perfectly secure VSS and perfectly secure MPC exist in an asynchronous network iff n ≥ 4t+1. Hence, we call any perfectly secure VSS (MPC) protocol designed over an asynchronous network with n = 4t + 1 as optimally resilient VSS (MPC) protocol. A secret is d-shared among the parties if there exists a random degreed polynomial whose constant term is the secret and each honest party possesses a distinct point on the degree-d polynomial. Typically VSS is used as a primary tool to generate t-sharing of secret(s). In this paper, we present an optimally resilient, perfectly secure Asynchronous VSS (AVSS)

•Jan 1, 2010•0 citations

Secure Computation by Secret Sharing using Input Encrypted with Random Number

Keiichi Iwamura, Ahmad Akmal Aminuddin Mohd Kamal

International Conference on Security and Cryptography•Jan 1, 2021•5 citations
Building on recent constructions of Quantum Cross Subspace Alignment (QCSA) codes, this work develops a coding scheme for QEXSTPIR, i.e., classical private information retrieval with X -secure storage andTTT-private queries, over a quantum multiple access channel, that is resilient to any set of up toEEEerased servers (equivalently known as unresponsive servers, or stragglers). The scheme is accordingly labeled QECSA, with the ‘E\mathbf{E}E,indicating resilience to erased servers. The novelty of QECSA lies in achieving efficient E-straggler resilience on top of existing QCSA codes that already achieve X-secure storage, T- private queries, and distributed superdense coding gains for communication efficient decoding. The QECSA code structure may be broadly useful for problems such as quantum coded secure distributed computation, where security, straggler resilience, and distributed superdense coding gains are simultaneously required.
A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret weight-1 vector (equivalently, a point function) across two or more parties. The appealing lightweight structure of DPF constructions has enabled a wide range of applications. These include private information retrieval, anonymous messaging, secure computation with preprocessing, and pseudorandom correlation generators for expanding small correlated seeds into large pseudorandom instances of cryptographic correlations. In this article, we survey definitions, constructions, and applications of DPFs. We also discuss the extension of DPF to function secret sharing (FSS), which generalizes point functions to support richer function classes. Efficient FSS schemes yield a similar generalization for most of the applications of DPFs.
Abstract. Verifiable Secret Sharing (VSS) is a fundamental primitive used in many distributed cryptographic tasks, such as Multiparty Computation (MPC) and Byzantine Agreement (BA). It is a two phase (sharing, reconstruction) protocol. The VSS and MPC protocols are carried out among n parties, where t out of n parties can be under the influence of a Byzantine (active) adversary, having unbounded computing power. It is well known that protocols for perfectly secure VSS and perfectly secure MPC exist in an asynchronous network iff n ≥ 4t+1. Hence, we call any perfectly secure VSS (MPC) protocol designed over an asynchronous network with n = 4t + 1 as optimally resilient VSS (MPC) protocol. A secret is d-shared among the parties if there exists a random degreed polynomial whose constant term is the secret and each honest party possesses a distinct point on the degree-d polynomial. Typically VSS is used as a primary tool to generate t-sharing of secret(s). In this paper, we present an optimally resilient, perfectly secure Asynchronous VSS (AVSS)