Symmetric cryptographic protocols for extended millionaires’ problem

来源 :Science in China(Series F:Information Sciences) | 被引量 : 0次 | 上传用户:email_97
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions. Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient. Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater. If the numbers are real, existing solutions do not directly work. These features limit the extensive application of the existing protocols. This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols. We further prove, by a well accepted simulation paradigm, that these protocols are private. Constructed based on symmetric cryptography, these protocols are very efficient. Yao, millionaires ’problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions. Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient. Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater. If the numbers are real, existing solutions do not directly work. These features limit the extensive application of the existing protocols. This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires ’problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols. prove, by a well accepted simulation paradigm, tha t these protocols are private. Constructed based on symmetric cryptography, these protocols are very efficient.
其他文献
九、抢篮板球的秘诀 我从来不喜欢得分,从来不。我喜欢抢蓝板球。我要将连续当选篮板王的纪录打破。只要我成功了,他们就不得不承认我是有史以来最伟大的球员之一。 连续当
有一种情结叫做英雄。有一种心情叫做怀旧。“新安江”对军品收藏的热爱,或许就源于这两个原因。“新安江”是他的网名,朋友很多时候就这么称呼他。1995年到1998年间,“新安
主持人:感谢大家关注这一期柠檬茶座,本期柠檬茶将为大家解密重卡经销商给客户的金融支持。我们请到了陕汽、重汽、一汽解放的三位经销商来做客,先请三位嘉宾做个简短的自我
岳南全景展现民国学人群体,前所未有。《陈寅恪与傅斯年》《从蔡元培到胡适》《南渡北归》《大师远去》这一系列作品,囊括中央研究院、西南联大知识分子群体。岳南笔下的民国
一、诗人?小说家?艺术家?宁肯曾经是个不错的诗人和很潮的散文家,现在当然更是小说家了。但我以为,在骨子里,他其实是个艺术家。诗人也好,散文家也好,小说家也好,其实都是他
Reaction of a 1, 2, 4, 5-tetraoxane with cysteinate-iron in thepresence of excess methyl cysteinate led to formation of sulfur-alkylated methyl cysteinate in 3
火炬松和湿地松原产美国东南部。本文对引种于我国的火炬松和湿地松染色体组型作了初步的比较,研究结果如下。1材料和方法种子材料由湖北省林科院提供。种子经双氧水消毒后,置
An ultraviolet (UV) Raman lidar system at 354.7 nm has been developed for accurately measuring the aerosol extinction profiles. A spectroscopic filter combining
央视著名节目主持人柴静非常善于打开陌生人的话匣子,好多让同行觉得吃力的采访任务,只要她一出马就能顺利完成。那么,柴静究竟有什么独门秘笈呢?  敞开心扉  19岁那年,入行不久的柴静在湖南文艺广播电台做兼职节目主持人,主持一档名叫《夜色温柔》的互动栏目,通过电话与陌生的嘉宾谈自己的秘密和人生的烦恼。  柴静做节目的时候最担心嘉宾不说话,如果主持人接不上,就会造成冷场。她经过认真思考,觉得要想让别人敞
“给我们一杯橙汁、一壶菊花茶再加两个杯子吧。”他说。当我告诉他晚上喝茶会影响睡眠时,他笑着问,“你自己尝试过吗?”我不知道该如何回答,确实,我只是听说。于是,他也给了