Counting-based secret sharing technique for multimedia applications
- 2 November 2017
- journal article
- research article
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (5) , 5591-5619
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Utilization of Two Diacritics for Arabic Text Steganography to Enhance PerformanceLecture Notes on Information Theory, 2015
- High speed hardware architecture to compute galois fields GF(p) montgomery inversion with scalability featuresIET Computers & Digital Techniques, 2007
- Optimum Secret Sharing Scheme Secure against CheatingSIAM Journal on Discrete Mathematics, 2006
- Efficient unified Montgomery inversion with multibit shiftingIEE Proceedings - Computers and Digital Techniques, 2005
- Efficient scalable VLSI architecture for Montgomery inversion in (p)Integration, 2004
- Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space2001
- Fully dynamic secret sharing schemesTheoretical Computer Science, 1996
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage1995
- A modular approach to key safeguardingIEEE Transactions on Information Theory, 1983
- On sharing secrets and Reed-Solomon codesCommunications of the ACM, 1981