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

Multimedia Tools and Applications

Non-interactive verifiable LWE-based multi secret sharing scheme

Niloofar Kiamari, Massoud Hadian Dehkordi, Samaneh Mashhadi

Published Jul 4, 2022• 7 citations
Publisher
DOI
10.1007/s11042-022-13347-4

Related papers

Multi-key Homomorphic Secret Sharing from LWE Without Multi-key HE

Peiying Xu, Li-Ping Wang

Lecture notes in computer science•Jan 1, 2023•8 citations

A d-dimensional Efficient and Verifiable Quantum Multi-secret Sharing Scheme

Fulin Li, Jiayu Gu, Shixin Zhu

International Journal of Theoretical Physics•Jun 4, 2025•2 citations

A Practical Framework for Lattice-Based Non-interactive Publicly Verifiable Secret Sharing

Behzad Abdolmaleki, John Clark, Mohammad Foroutani +2 more

Lecture notes in computer science•Jan 1, 2026•0 citations

A Verifiable (k,n,m)-Threshold Multi-secret Sharing Scheme Based on NTRU Cryptosystem

Ali Nakhaei Amroudi, Ali Zaghain, Mahdi Sajadieh

Wireless Personal Communications•Apr 26, 2017•12 citations

Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model

Anderson C. A. Nascimento, Joern Mueller-Quade, Akira Otsuka +2 more

Lecture notes in computer science•Jan 1, 2004•10 citations

Post-Quantum Access Control with Application to Secure Data Retrieval

Behzad Abdolmaleki, Hannes Blümel, Tianxiang Dai +4 more

Servan-Schreiber et al. [IEEE S& P, 2023] presented a new notion called private access control lists (PACL) for function secret sharing (FSS), where the FSS evaluators can ensure that the FSS dealer is authorized to share the given function. Their construction relies on costly non-interactive secret-shared proofs and is not secure in the post-quantum setting. We give a construction of PACL from publicly verifiable secret sharing (PVSS) under the short integer solution (SIS) problem. Our construction adapts the Gentry et al.'s scheme [EUROCRYPT, 2022] for the post-quantum setting based on the learning with error (LWE) assumption aimed at ensuring that database access control policies are enforced by FSS evaluators, who verify that the FSS dealer is authorized to share the specified database query function. The benchmarks of our PACL show a trade-off between proving and verification efficiency, making the optimal choice dependent on application requirements. This construction has many applications for access control by applying FSS. We also present a secure data retrieval scheme using DPF-PACL for access control, which complements the PACL framework while providing independent utility.

IACR Communications in Cryptology•Oct 6, 2025•0 citations
Servan-Schreiber et al. [IEEE S& P, 2023] presented a new notion called private access control lists (PACL) for function secret sharing (FSS), where the FSS evaluators can ensure that the FSS dealer is authorized to share the given function. Their construction relies on costly non-interactive secret-shared proofs and is not secure in the post-quantum setting. We give a construction of PACL from publicly verifiable secret sharing (PVSS) under the short integer solution (SIS) problem. Our construction adapts the Gentry et al.'s scheme [EUROCRYPT, 2022] for the post-quantum setting based on the learning with error (LWE) assumption aimed at ensuring that database access control policies are enforced by FSS evaluators, who verify that the FSS dealer is authorized to share the specified database query function. The benchmarks of our PACL show a trade-off between proving and verification efficiency, making the optimal choice dependent on application requirements. This construction has many applications for access control by applying FSS. We also present a secure data retrieval scheme using DPF-PACL for access control, which complements the PACL framework while providing independent utility.