Secret Sharing With Reusable Polynomials

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0027925
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Linear (T,n) Secret Sharing Scheme With Reduced Number of Polynomials

Security and Communication Networks
Computer NetworksInformation SystemsCommunications
2019English

Secret Sharing With Public Reconstruction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Non-Malleable Secret Sharing

2018English

Threshold Cryptosystem With Multiple Secret Sharing Policies

IEE Proceedings - Computers and Digital Techniques
1994English

Efficient Multi Secret Sharing With Generalized Access Structures

International Journal of Computer Applications
2014English

Verifiable Essential Secret Image Sharing With Multiple Decryptions

International Journal of Recent Technology and Engineering
EngineeringManagement of TechnologyInnovation
2019English

Secret Sharing Using Meaningful Images

Journal of Advanced Management Science
2013English

A (N,t,n) Verifiable Multi-Secret Sharing Scheme With Secure Secret Reconstruction

International Journal of Security and its Applications
Computer Science
2015English

Universally Ideal Secret-Sharing Schemes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy