Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties

Gentry, Craig; Halevi, Shai; Lyubashevsky, Vadim

doi:10.1007/978-3-031-06944-4_16

Cited by 34 publications

(3 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A very relevant recent work is the VSS protocol of Gentry et al [22]. That work is motivated similarly to ours, namely, they aim at feasible threshold protocols for the YOSO model.…”

Section: Related Workmentioning

confidence: 93%

Threshold Cryptography as a Service (in the Multiserver and YOSO Models)

Benhamouda¹,

Halevi²,

Krawczyk³

et al. 2022

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

We consider large deployments of threshold cryptographic services that can run in traditional multi-server settings and, at a much larger scale, in blockchain environments. We present a set of techniques that improve performance and meet the requirements of settings with large number of servers and high rate of threshold operations. More fundamentally, our techniques enable threshold cryptographic applications to run in more challenging decentralized permissionless systems, such as contemporary blockchains.In particular, we design and implement a novel threshold solution for the recently introduced YOSO (You Only Speak Once) model. The model builds on ever changing, unpredictable committees that perform ephemeral roles in a way that evades targeting by attackers and enables virtually unlimited scalability in very large networks. Our solution allows for the maintenance of system-wide keys that can be generated, used and proactivized as needed. The specific techniques build on optimized protocols for multi-secret multidealer verifiable secret sharing and their adaptation to the YOSO model.We demonstrate the practicality of our solutions by reporting on an end-to-end implementation of a proactive re-sharing protocol in the YOSO model, showing benchmarks for committees of sizes up to 500 nodes. For traditional multi-server settings, we obtain significant speedups in settings where dealers process many secrets simultaneously (say, to generate or proactivize many keys at the same time), e.g., we show 5× improvements relative to classical Pedersen VSS for 15 servers and 50 secrets, and 48× for 500 servers and 1000 secrets.

show abstract

“…A very relevant recent work is the VSS protocol of Gentry et al [22]. That work is motivated similarly to ours, namely, they aim at feasible threshold protocols for the YOSO model.…”

Section: Related Workmentioning

confidence: 93%

Threshold Cryptography as a Service (in the Multiserver and YOSO Models)

Benhamouda¹,

Halevi²,

Krawczyk³

et al. 2022

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

show abstract

“…To support very large committees with tens of thousands of participants, the scheme's communication and computation need to be sufficiently efficient. To this end, Gentry et al [52] proposed a non-interactive PVSS scheme based on the LWE. To further save bandwidth, they use the PVW encryption scheme in the multi-receiver setting along with bulletproofs to obtain compact proofs of correct share encryption and decryption.…”

Section: Lattice-based Vssmentioning

confidence: 99%

Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey

Chen,

Deng,

et al. 2024

Electronics

View full text Add to dashboard Cite

As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.

show abstract

“…Recently, the SCRAPE [8] and ALBATROSS [9] PVSS schemes have significantly improved on the complexity of such schemes by making the share validity check and reconstructions procedures cheaper than previous works. While these works are based on number theoretical assumptions, a recent work has shown how to efficiently build PVSS from lattice based assumptions [17]. These works are not fit for the YOSO model because they require the parties to know the identities (or rather the public keys) of the parties receiving the shares when checking share validity, precluding (re)sharing towards anonymous parties.…”

Section: Rpirmentioning

confidence: 99%

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model

Cascudo¹,

David²,

Garms³

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Achieving adaptive (or proactive) security in cryptographic protocols is notoriously difficult due to the adversary's power to dynamically corrupt parties as the execution progresses. Inspired by the work of Benhamouda et al. in TCC 2020, Gentry et al. in CRYPTO 2021 introduced the YOSO (You Only Speak Once) model for constructing adaptively (or proactively) secure protocols in massively distributed settings (e.g. blockchains). In this model, instead of having all parties execute an entire protocol, smaller anonymous committees are randomly chosen to execute each individual round of the protocol. After playing their role, parties encrypt protocol messages towards the the next anonymous committee and erase their internal state before publishing their ciphertexts. However, a big challenge remains in realizing YOSO protocols: efficiently encrypting messages towards anonymous parties selected at random without learning their identities, while proving the encrypted messages are valid with respect to the protocol. In particular, the protocols of Benhamouda et al. and of Gentry et al. require showing ciphertexts contain valid shares of secret states. We propose concretely efficient methods for encrypting a protocol's secret state towards a random anonymous committee. We start by proposing a very simple and efficient scheme for encrypting messages towards randomly and anonymously selected parties. We then show constructions of publicly verifiable secret (re-)sharing (PVSS) schemes with concretely efficient proofs of (re-)share validity that can be generically instantiated from encryption schemes with certain linear homomorphic properties. In addition, we introduce a new PVSS with proof of sharing consisting of just two field elements, which as far as we know is the first achieving this, and may be of independent interest. Finally, we show that our PVSS schemes can be efficiently realized from our encyption scheme. * Ignacio Cascudo was supported by the Spanish Government under the project SecuRing (ref. PID2019-110873RJ-I00/AEI/10.13039/501100011033), by the Madrid Government as part of the program S2018/TCS-4339 (BLOQUES-CM) co-funded by EIE Funds of the European Union, and by a research grant from Nomadic Labs and the Tezos Foundation.† Bernardo David was supported by the Concordium Foundation and by the Independent Research Fund Denmark (IRFD) grants number 9040-00399B (TrA 2 C), 9131-00075B (PUMA) and 0165-00079B.‡ Lydia Garms was supported by a research grant from Nomadic Labs and the Tezos Foundation.§ Anders Konring was supported by the IRFD grant number 9040-00399B (TrA 2 C).

show abstract

Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties

Cited by 34 publications

References 48 publications

Threshold Cryptography as a Service (in the Multiserver and YOSO Models)

Threshold Cryptography as a Service (in the Multiserver and YOSO Models)

Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model

Contact Info

Product

Resources

About