判定不是(k,n)门限方案的简易方法
Saved in:
| Main Authors: | 岳殿武, 胡正名 |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
1996-01-01
|
| Series: | Tongxin xuebao |
| Online Access: | http://www.joconline.com.cn/zh/article/74379263/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
没有SDC的(t,n)门限秘密共享方案
by: 周福才, et al.
Published: (2006-01-01) -
一个新的具有指定接收者(t,n)门限签名加密方案
by: 曹珍富, et al.
Published: (2003-01-01) -
一个新的具有指定接收者(t,n)门限签名加密方案
by: 曹珍富, et al.
Published: (2003-01-01) -
一个高效的门限共享验证签名方案及其应用
by: 张彰, et al.
Published: (2003-01-01) -
基于单向散列链的可更新(t,n)门限秘密共享方案
by: 李大伟, et al.
Published: (2010-01-01)