Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,272,386 papers from all fields of science
Search
Sign In
Create Free Account
Shamir's Secret Sharing
Shamir's Secret Sharing is an algorithm in cryptography created by Adi Shamir. It is a form of secret sharing, where a secret is divided into parts…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Algorithm
Alice and Bob
Crypto++
Cryptography
Expand
Broader (1)
Secret sharing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
Ignacio Cascudo
,
B. David
IACR Cryptology ePrint Archive
2020
Corpus ID: 219601592
. In this paper we present ALBATROSS, a family of multiparty randomness generation protocols with guaranteed output delivery and…
Expand
2019
2019
Efficient Secure Floating-point Arithmetic using Shamir Secret Sharing
Octavian Catrina
International Conference on E-Business and…
2019
Corpus ID: 201902483
Successful deployment of privacy preserving collaborative applications, like statistical analysis, benchmarking, and…
Expand
Review
2019
Review
2019
Overview of Blakley's Secret Sharing Scheme
Alireza Shamsoshoara
arXiv.org
2019
Corpus ID: 57759396
In this report, I explained the problem of Secret Sharing Scheme. Then based on the definition of the problem, two old methods…
Expand
Highly Cited
2018
Highly Cited
2018
SHARVOT: Secret SHARe-Based VOTing on the Blockchain
Silvia Bartolucci
,
P. Bernat
,
D. Joseph
International Workshop on Emerging Trends in…
2018
Corpus ID: 3844225
Recently, there has been a growing interest in using online technologies to design protocols for secure electronic voting. The…
Expand
2017
2017
S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing
Thang Hoang
,
Ceyhun D. Ozkaptan
,
A. Yavuz
,
J. Guajardo
,
Tam V. Nguyen
IACR Cryptology ePrint Archive
2017
Corpus ID: 207721685
Oblivious Random Access Machine (ORAM) enables a client to access her data without leaking her access patterns. Existing client…
Expand
2014
2014
Verifiable secret sharing based on the Chinese remainder theorem
L. Harn
,
Fuyou Miao
,
Chinchen Chang
Secur. Commun. Networks
2014
Corpus ID: 26835323
A t,n secret sharing scheme SS enables a dealer to divide a secret into n shares in such a way that i the secret can be recovered…
Expand
2012
2012
Information-Flow Control for Programming on Encrypted Data
John C. Mitchell
,
Rahul Sharma
,
D. Stefan
,
Joe Zimmerman
IEEE Computer Security Foundations Symposium
2012
Corpus ID: 2942169
Using homomorphic encryption and secure multiparty computation, cloud servers may perform regularly structured computation on…
Expand
2006
2006
Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
Christophe Tartary
,
Huaxiong Wang
Conference on Information Security and Cryptology
2006
Corpus ID: 1679257
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t,n)-threshold scheme without…
Expand
2004
2004
Several Generalizations Of Shamir's Secret Sharing Scheme
Chunren Lai
,
C. Ding
International Journal of Foundations of Computer…
2004
Corpus ID: 207104473
A secret sharing scheme is a system designed to share a piece of information or the secret among a group of people such that only…
Expand
Highly Cited
2004
Highly Cited
2004
Personalised cryptographic key generation based on FaceHashing
A. Teoh
,
D. Ngo
,
A. Goh
Computers & security
2004
Corpus ID: 8286447
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE