short-paper

(t,p)-Threshold point function secret sharing scheme based on polynomial interpolation and its application

Authors:

Dazeng Yuan,

Mingxing He,

Shengke Zeng,

Xiao Li,

Long LuAuthors Info & Claims

UCC '16: Proceedings of the 9th International Conference on Utility and Cloud Computing

Pages 269 - 275

https://doi.org/10.1145/2996890.3007871

Published: 06 December 2016 Publication History

Get Access

Abstract

Point function secret sharing(PFSS)was a special kind of function secret sharing(FSS)that was a special case of secret sharing,that the shared secret was a point function instead of a value.Motivated by the reason that the PFSS has very good application in the secure multi-party computations by investigating,and the existing PFSS scheme without threshold and inefficient.A new (t, p)--PFSS scheme based on polynomial interpolation was proposed,and this PFSS scheme is secure and efficient by analyzing the correctness,the security and the efficiency of the scheme,and is the first threshold PFSS scheme.then an example was given to demonstrate scheme has effectiveness.Lastly,we respectively construct a (t, p)--threshold multi-server PIR and secure keyword search protocol,and a (t, p)--threshold incremental secret sharing protocol,both based on the proposed (t, p)--PFSS scheme,and simple analysis the correctness and the security of the first protocol.

References

[1]

De Santis A,Desmedt Y,Frankel Y,et al.How to share a function secu- rely{C},Proceedings of the twenty-sixth annual ACM symposium on Theory of computing.ACM,1994:522--533.

Digital Library

Google Scholar

[2]

Shamir A.How to share a secret{J}.Communications of the ACM,1979,22(11):612--613čő

Digital Library

Google Scholar

[3]

Blakley G R. Safeguarding cryptographic keys{J}. Proc. of the National Computer Conference1979,1979,48: 313--317.

Crossref

Google Scholar

[4]

Asmuth C,Bloom J.A modular approach to key safeguarding{J}. IEEE transactions on information theory,1983,30(2):208--210.

Digital Library

Google Scholar

[5]

Karnin E, Greene J, Hellman M. On secret sharing systems{J}. IEEE Transactions on Information Theory, 1983, 29(1): 35--41.

Digital Library

Google Scholar

[6]

Komargodski I, Zhandry M. Cutting-edge cryptography through the lens of secret sharing{C},Theory of Cryptography Conference. Springer Berlin Heidelberg, 2016: 449--479.

Google Scholar

[7]

Boyle E,Gilboa N,Ishai Y.Function secret sharing{C},Annual Internat- ional Conference on the Theory and Applications of Cryptographic Techniques.Springer Berlin Heidelberg,2015:337--367.

Google Scholar

[8]

Gilboa N, Ishai Y. Distributed point functions and their applications{C},Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2014: 640--658.

Google Scholar

[9]

Ostrovsky R, Skeith III W E. Private searching on streaming data{C},Annual International Cryptology Conference. Springer Berlin Heidelberg, 2005: 223--240.

Digital Library

Google Scholar

[10]

Ostrovsky R, Shoup V. Private information storage{C},Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. ACM, 1997: 294--303.

Digital Library

Google Scholar

[11]

Chor B, Kushilevitz E, Goldreich O, et al. Private information retrieval{J}. Journal of the ACM (JACM), 1998, 45(6): 965--981.

Digital Library

Google Scholar

[12]

Beimel A, Ishai Y, Kushilevitz E, et al. Breaking the O(n 1 (2k-1)/) barrier for information-theoretic Private Information Retrieval{C},Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on. IEEE, 2002: 261--270.

Digital Library

Google Scholar

[13]

Beimel A, Ishai Y, Kushilevitz E.General constructions for information-theoretic private information retrieval{J}.Journal of Computer and System Sciences,2005, 71(2):213--247.

Digital Library

Google Scholar

[14]

Ullman J D.Principles of database systems{M}. Galgotia publications,1984.

Digital Library

Google Scholar

Cited By

View all

Saeidi ZYazdi AMashhadi SHadian MGutub A(2023)High performance image steganography integrating IWT and Hamming code within secret sharingIET Image Processing10.1049/ipr2.1293818:1(129-139)Online publication date: 28-Sep-2023
https://doi.org/10.1049/ipr2.12938
Luo JZhang LLin FLin C(2020)Efficient Threshold Function Secret Sharing With Information-Theoretic SecurityIEEE Access10.1109/ACCESS.2019.29636778(6523-6532)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2019.2963677
Jiang ZLiu LPang L(2018)Research on oblivious keyword search protocols with CKA securityInternational Journal of Communication Systems10.1002/dac.376631:15Online publication date: 31-Jul-2018
https://doi.org/10.1002/dac.3766

Recommendations

On a Fast (k,n)-Threshold Secret Sharing Scheme

In Shamir's ( k, n )-threshold secret sharing scheme (threshold scheme) [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. ...
Sure Interpolation and Its Application to Hierarchical Threshold Secret Sharing Scheme
ISCSCT '08: Proceedings of the 2008 International Symposium on Computer Science and Computational Technology - Volume 01

A threshold secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret. Threshold secret sharing is useful in management of cryptographic keys. Based on ...
Fair (t, n) threshold secret sharing scheme

In the setting of secret sharing, a group of parties wish to run a protocol for recovering the secret when they input their shares. The security requirement include privacy, correctness and others. One desirable property is fairness, which guarantees ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

UCC '16: Proceedings of the 9th International Conference on Utility and Cloud Computing

December 2016

549 pages

ISBN:9781450346160

DOI:10.1145/2996890

General Chairs:
Changjun Jiang
Tongji University, China
,
Omer Rana
Cardiff University, UK
,
Nick Antonopoulos
University of Derby, UK

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 December 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

UCC '16

UCC '16: 9th International Conference on Utility and Cloud Computing

December 6 - 9, 2016

Shanghai, China

Acceptance Rates

Overall Acceptance Rate 38 of 125 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
93
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Saeidi ZYazdi AMashhadi SHadian MGutub A(2023)High performance image steganography integrating IWT and Hamming code within secret sharingIET Image Processing10.1049/ipr2.1293818:1(129-139)Online publication date: 28-Sep-2023
https://doi.org/10.1049/ipr2.12938
Luo JZhang LLin FLin C(2020)Efficient Threshold Function Secret Sharing With Information-Theoretic SecurityIEEE Access10.1109/ACCESS.2019.29636778(6523-6532)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2019.2963677
Jiang ZLiu LPang L(2018)Research on oblivious keyword search protocols with CKA securityInternational Journal of Communication Systems10.1002/dac.376631:15Online publication date: 31-Jul-2018
https://doi.org/10.1002/dac.3766

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

On a Fast (k,n)-Threshold Secret Sharing Scheme

Sure Interpolation and Its Application to Hierarchical Threshold Secret Sharing Scheme

Fair (t, n) threshold secret sharing scheme