Safeguarding cryptographic keys
Abstract
The following topics are dealt with: operating systems (computers); security of data; multiprocessing systems; software engineering; microprocessor chips; software maintenance; software metrics; relational databases; computer networks; storage management.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The scheme proposed by Shamir relies on standard Lagrange polynomial interpolation, while Blakley's proposal, also known as vector scheme, relies on the geometric concept of intersecting hyperplanes.
“The scheme proposed by Shamir relies on standard Lagrange polynomial interpolation, while Blakley's proposal, also known as vector scheme, relies on the geometric concept of intersecting hyperplanes.”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [124]
In 1979, Shamir and Blakely proposed two variations of threshold-based secret sharing schemes.
“In 1979, Shamir [123] and Blakely [124] proposed two variations of threshold-based secret sharing schemes.”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [124]
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
Gilbert, E. N., Macwilliams, F. J., & Sloane, N. J. A. (1974) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1974.tb02751.x · Cited by 385 · see citing works
Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages
Blakley, G. R., & Borosh, I. (1979) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(79)90039-7 · Cited by 67 · see citing works
Self-citationASSESSMENT OF THE NATIONAL BUREAU OF STANDARDS PROPOSED FEDERAL DATA ENCRYPTION STANDARD
Morris, R. H., Sloane, N. J. A., & Wyner, A. D. (1977) · Cryptologia · doi:10.1080/0161-117791833020 · Cited by 36 · see citing works
Shoup, V. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9781139165464.009 · Cited by 2 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · see citing works
Cleve, R., Gottesman, D., & Lo, H.-K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.648 · Cited by 1,373 · see citing works
Yin, X., Zhu, Y., & Hu, J. (2022) · ACM Computing Surveys · doi:10.1145/3460427 · Cited by 638 · see citing works
Privacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 430 · see citing works
“Another approach is called Secret Sharing, created independently by authors of [131] and [132].”
Blockchain-based Personal Health Data Sharing System Using Cloud Storage
Zheng, X., Mukkamala, R. R., Vatrapu, R., & Ordieres-Mere, J. (2018) · 2018 IEEE 20th International Conference on e-Health Networking, Applications and Services (Healthcom) · doi:10.1109/healthcom.2018.8531125 · Cited by 281 · see citing works
A Survey of Self-Sovereign Identity Ecosystem
Soltani, R., Nguyen, U. T., & An, A. (2021) · Security and Communication Networks · doi:10.1155/2021/8873429 · Cited by 131 · see citing works
“In 1979, Shamir [123] and Blakely [124] proposed two variations of threshold-based secret sharing schemes. scheme proposed by Shamir relies on standard Lagrange polynomial interpolation, while Blakley’s proposal, also known as vector scheme, relies on the geometric concept of intersecting hyperplanes.”
BackgroundPractical Key Recovery Model for Self-Sovereign Identity Based Digital Wallets
Soltani, R., Nguyen, U. T., & An, A. (2019) · 2019 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · doi:10.1109/dasc/picom/cbdcom/cyberscitech.2019.00066 · Cited by 39 · see citing works
Efficient Group-Key Management for Low-bandwidth Smart Grid Networks
Hanna, Y., Cebe, M., Mercan, S., & Akkaya, K. (2021) · 2021 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) · doi:10.1109/smartgridcomm51999.2021.9631988 · Cited by 8 · see citing works
Decentralized and Privacy-Preserving Key Management Model
Soltani, R., Nguyen, U. T., & An, A. (2020) · 2020 International Symposium on Networks, Computers and Communications (ISNCC) · doi:10.1109/isncc49221.2020.9297294 · Cited by 8 · see citing works
Function-Based Access Control (FBAC): Towards Preventing Insider Threats in Organizations
Desmedt, Y., & Shaghaghi, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-04834-1_8 · Cited by 5 · see citing works
- Authors
- BLAKLEY, G. R.
- Affiliations
- Texas A&M University (US)
- Corresponding author
- BLAKLEY, G. R.
- Venue
- 1979 International Workshop on Managing Requirements Knowledge (MARK)
- Publisher
- IEEE
- Published
- 1979-06
- Pages
- 313-318
- OpenAlex
- W2970097841
- Cited by
- 3,499
- References
- 5
- Citations by year
- 2026: 68 · 2025: 138 · 2024: 114 · 2023: 149 · 2022: 150 · 2021: 178 · 2020: 189 · 2019: 189 · 2018: 160 · 2017: 147 · 2016: 177 · 2015: 183 · 2014: 165 · 2013: 172 · 2012: 159
- FWCI
- 1.83
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Workshop on Managing Requirements Knowledge (MARK) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Security and Verification in Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- key management, data security, operating systems, multiprocessor systems, software engineering, microprocessors, software maintenance, software metrics, relational databases, computer networks, storage management
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
