A key escrow scheme with time-limited monitoring for one-way communication

被引:2
作者
Abe, M [1 ]
Kanda, M [1 ]
机构
[1] NTT Labs, Yokosuka, Kanagawa 2390847, Japan
关键词
D O I
10.1093/comjnl/45.6.661
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies several of the properties necessary for public-key-based escrow schemes, and observes that previous schemes lack some important properties. Focusing on the type of communication typified by email, we construct a novel and simple scheme that provides 'warrant bounds', 'admissibility', 'surveillance switching', 'non-directive monitoring', 'off-line agency' and many other useful properties all at the same time.
引用
收藏
页码:661 / 671
页数:11
相关论文
共 29 条
[1]  
[Anonymous], 1997, ACM C COMPUTER COMMU, P78, DOI DOI 10.1145/266420.266439
[2]  
[Anonymous], LNCS
[3]  
Bellare M, 1998, LECT NOTES COMPUT SC, V1462, P26, DOI 10.1007/BFb0055718
[4]   A concrete security treatment of symmetric encryption [J].
Bellare, M ;
Desai, A ;
Jokipii, E ;
Rogaway, P .
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, :394-403
[5]   Translucent cryptography - An alternative to key escrow, and its implementation via fractional oblivious transfer [J].
Bellare, M ;
Rivest, RL .
JOURNAL OF CRYPTOLOGY, 1999, 12 (02) :117-139
[6]  
Bellare M., 1995, P 1 ACM C COMPUTER C, P62
[7]  
Ben-Or M., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P1, DOI 10.1145/62212.62213
[8]  
Burmester M, 1998, LECT NOTES COMPUT SC, V1514, P380
[9]  
CRAMER R, 1994, LNCS, V839, P174, DOI DOI 10.1007/3-540-48658-5
[10]  
FEIGE U, 1990, PROCEEDINGS OF THE TWENTY SECOND ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, P416, DOI 10.1145/100216.100272