Verifiable secret sharing based on the Chinese remainder theorem
Article first published online: 11 JUN 2013
Copyright © 2013 John Wiley & Sons, Ltd.
Security and Communication Networks
Volume 7, Issue 6, pages 950–957, June 2014
How to Cite
Harn, L., Fuyou, M. and Chang, C.-C. (2014), Verifiable secret sharing based on the Chinese remainder theorem. Security Comm. Networks, 7: 950–957. doi: 10.1002/sec.807
- Issue published online: 24 APR 2014
- Article first published online: 11 JUN 2013
- Manuscript Accepted: 15 APR 2013
- Manuscript Revised: 7 MAR 2013
- Manuscript Received: 18 DEC 2012
Options for accessing this content:
- If you have access to this content through a society membership, please first log in to your society website.
- If you would like institutional access to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!