Serial interpolation for secure membership testing and matching in a secret-split archive
The various technologies presented herein relate to analyzing a plurality of shares stored at a plurality of repositories to determine whether a secret from which the shares were formed matches a term in a query. A threshold number of shares are formed with a generating polynomial operating on the secret. A process of serially interpolating the threshold number of shares can be conducted whereby a contribution of a first share is determined, a contribution of a second share is determined while seeded with the contribution of the first share, etc. A value of a final share in the threshold number of shares can be determined and compared with the search term. In the event of the value of the final share and the search term matching, the search term matches the secret in the file from which the shares are formed.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- Assignee:
- Sandia Corporation (Albuquerque, NM)
- Patent Number(s):
- 9,514,326
- Application Number:
- 14/513,769
- OSTI ID:
- 1334633
- Resource Relation:
- Patent File Date: 2014 Oct 14
- Country of Publication:
- United States
- Language:
- English
Systems and methods for distributing and securing data
|
patent | April 2012 |
Secure distributed item-level discovery service using secret sharing
|
patent | October 2012 |
System and method for processing a shared secret
|
patent | May 2014 |
The case for distributed data archival using secret splitting with Percival
|
conference | August 2013 |
How to share a secret
|
journal | November 1979 |
Similar Records
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Learning unions of boxes with membership and equivalence queries