助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   information-theoretically 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
电信技术
更多类别查询

图标索引 历史查询
 

information-theoretically
相关语句
  信息理论
     Information-Theoretically Analysis of Secure Steganographic System
     安全隐写系统的信息理论分析
短句来源
     Research on Information-theoretically Secure Secret-key Agreement
     信息理论安全密钥协商的研究
短句来源
     Information-Theoretically Secure Secret-Key Agreement Based on Noisy Authentic Channels
     基于有扰认证信道的信息理论安全密钥协商
短句来源
     Information-theoretically secure secret-key agreement is the key to make perfect security.
     信息理论安全密钥协商协议是实现完善保密的关键。
短句来源
     The main work in this thesis is as follows:1) A new information-theoretically seure channel model is proposed.
     1.提出了一种新的信息理论安全信道模型。
短句来源
  相似匹配句对
     INFORMATION
     华夏信息
短句来源
     INFORMATION
     信息之窗
短句来源
     Theoretically:
     理论方面:
短句来源
     2) theoretically.
     +3.2(?) +8。
短句来源
     Therefore,it is of value theoretically.
     因而具有一定的理论研究价值。
短句来源
查询“information-theoretically”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  information-theoretically
In the bounded-storage model for information-theoretically secure
      
We study the problem of information-theoretically secure encryption in
      
Alice and Bob share no secret key initially, and their goal is to generate, after public discussion, a common information-theoretically secure key facing an active eavesdropper Eve.
      
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is information-theoretically secure from the eavesdropper.
      


Previous results on privacy amplification assumed that an opponent has access to the public channel but is passive or , equivalently, that messages inserted by the opponent can be detected by two parties. In this paper, we consider privacy amplification secure against active opponents. The common string which is partially secret between two parties is used to information-theoretically authenticate messages over the public channel . We conclude that for sufficiently large common string privacy amplification...

Previous results on privacy amplification assumed that an opponent has access to the public channel but is passive or , equivalently, that messages inserted by the opponent can be detected by two parties. In this paper, we consider privacy amplification secure against active opponents. The common string which is partially secret between two parties is used to information-theoretically authenticate messages over the public channel . We conclude that for sufficiently large common string privacy amplification is possible when the opponent's min-entropy about the common string exceeds 2/3 the size of the string. The relationship between the size of highly secret string distilled and the opponent's min-entropy is also illustrated.

以前对保密增强理论的研究都是基于这样一个前提:敌手是被动攻击者,即敌手只能在公共信道上进行窃听而不能篡改信道上所传递的信息。本文主要研究能够防主动攻击的保密增强:借助于通信双方间共享的部分保密串作为认证密钥,实现信息理论安全认证以防止主动攻击。同时得出结论:如果敌手关于部分保密串的最小熵至少是串长的2/3,那么,只要部分保密串足够长,防主动攻击的保密增强就有可能实现。此外还给出了保密增强能够提取出的高度保密串的长度与敌手关于部分保密串的最小熵的关系。

Multi-candidate electronic voting is very useful in numerous practical situations. Most of the previous schemes discuss Boolean vote in which voters can only cast “yesno” vote. A novel multi-candidates election scheme is presented which is appropriate for k-out-of-m election. The main idea is to express a ballot by a multi-precision number that allows voting for up to k out of the m candidates in one ballot. The purpose of the vote is to elect more than one winner among m candidates. The self-tallying protocol...

Multi-candidate electronic voting is very useful in numerous practical situations. Most of the previous schemes discuss Boolean vote in which voters can only cast “yesno” vote. A novel multi-candidates election scheme is presented which is appropriate for k-out-of-m election. The main idea is to express a ballot by a multi-precision number that allows voting for up to k out of the m candidates in one ballot. The purpose of the vote is to elect more than one winner among m candidates. The self-tallying protocol in the solution is based on the multi-precision arithmetic and the secure sum protocol without any trusted third party. In comparison with general methods, the results of this paper don't rely on any traditional cryptography or computation intractability assumption that is information-theoretically secure. This scheme achieves security including perfect ballot secrecy, receipt-free and dispute-freeness tally that extend the previous general security. Each participant takes only O(nm(log_2 n)) bit operations, which is more efficient than previous schemes. The scheme is very practical and can be efficiently implemented.

多候选人电子选举方案在许多实际环境下具有重要的应用价值,但现有绝大多数方案由于技术限制只能进行“两选一”投票·设计了一种新型的选票结构,在一个多精度数中隐藏“m选k”形式的选票,对m个候选人至多可以投k个赞成票;将多精度计算及安全多方求和协议应用于投票和计票,选举过程中不需要可信任第3方,任何投票人都可以计票·与一般方案相比,该方案具有更强的安全性,包括选票的完全保密性和无收据性、计票的公平性和无争议性、系统的健壮性等;无需使用传统的加密技术·对n个投票人,计算的位复杂性为O(nm(log2n)),其效率优于现有方案且容易实现·

This paper categorizes the fragmentary and unsystematic information theoretically,and conforms such issues as the legitimacy of limited liability,value judgment,external risk controversy and analysis each of them individually with a view that it would be helpful to the construction of limited liability system in China.

将零星的、缺乏系统的信息从理论上加以分类,按问题整合为有限责任的正当性问题、价值评判、外部风险论争、效率之争,并对其逐一予以分析,以期对我国的有限责任制度建设有所帮助。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关information-theoretically的内容
在知识搜索中查有关information-theoretically的内容
在数字搜索中查有关information-theoretically的内容
在概念知识元中查有关information-theoretically的内容
在学术趋势中查有关information-theoretically的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社