首页
社区
课程
招聘
[分享]Authentication of Concast Communication
发表于: 2009-5-18 19:43 5039

[分享]Authentication of Concast Communication

2009-5-18 19:43
5039
Authentication of Concast Communication
Mohamed Al-Ibrahim1, Hossein Ghodosi2, and Josef Pieprzyk3
1 Center for Computer Security Research, University of Wollongong
Wollongong, NSW 2522, Australia
[email]ibrahim@ieee.org[/email]
2 School of Information Technology, James CookU niversity
Townsville, Qld 4811, Australia
[email]hossein@cs.jcu.edu.au[/email]
3 Department of Computing, Macquarie University
Sydney, NSW 2109, Australia
[email]josef@ics.mq.edu.au[/email]

Abstract.
In this paper we tackle the problem of finding an efficient signature verification scheme when the number of signatures is signifi- cantly large and the verifier is relatively weak. In particular, we tackle the problem of message authentication in many-to-one communication networks known as concast communication. The paper presents three signature screening algorithms for a variant of ElGamal-type digital signatures. The cost for these schemes is n applications of hash functions, 2n modular multiplications, and n modular additions plus the verification of one digital signature, where n is the number of signatures. The paper also presents a solution to the open problem of finding a fast screening signature for non-RSA digital signature schemes.

※ 大家可能比教常聽到的是 Multicast, Broadcast  之類的,很少聽到 Concast,甚至查 dictionary 也查不到這個字。

現在就先瞭解一下, Multicast vs Concast。

Multicast:
One sender to many Receiver!
這是大家常見的 model.

Concast:
Many sender to one Receiver!
這就不知道了吼~

Ex:
1) 大家都寫信給看雪學院的壇主,就是 concast model.
2) 在教室裏,很多學生發言,但只有一位老師回答,這也是 concast model.
3) 其他的,請自己想像。

請問這跟密碼學有什麼關係!? Good Question~
因為大部份的加密都是 Multicast 的,不是 Concast 的。
不懂? 沒關係。

Ex:
我把【原创】流密碼內嵌魔方陣於隨機存檔之研究--Utility 這篇裏的 cipher.txt 都給你們大家,所以我是 一個 sender,而你們是 many receivesr,我只要告訴你們 A, B及 M 是什麼即可,您自己可以 decrypt 成 plain.txt。

可是,你們全部 10 人 把 palin.txt 全部 encrypt 過後後,我是不是要記住 10 個人的 key?
那可不可以只要記住一個 key 就可以 decrypt  cipher.txt  成 plain.txt !?
這就是 key point!


[注意]传递专业知识、拓宽行业人脉——看雪讲师团队等你加入!

上传的附件:
收藏
免费 0
支持
分享
最新回复 (2)
雪    币: 2096
活跃值: (100)
能力值: (RANK:420 )
在线值:
发帖
回帖
粉丝
2
Attack on a concast signature scheme
D.R. Stinson
School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

Abstract
Al-Ibrahim, Ghodosi and Pieprzyk proposed several methods of batch signature verification suitable for concast communication. These schemes are all based on El-Gamal-type signature schemes. We prove that their preferred scheme, which does not require interaction among the various signers, is insecure.

Keywords: Cryptography; Cryptanalysis; Signature schemes

Ps. 據說 D.R. Stinson 教授在世界密碼學專家的排名很前面 (約前20名)
上传的附件:
2009-5-28 01:12
0
雪    币: 2096
活跃值: (100)
能力值: (RANK:420 )
在线值:
发帖
回帖
粉丝
3
An Improvement of Concast Authentication Protocol

rock@phate.tw

Abstract
The Internet is a large network comprising of many machines, such that nearly every major enterprise and institution in the world is part of it. This huge community performs information exchange on a mammoth scale using various communication technologies. Information exchanged is often confidential, sensitive and/or valuable. The style of the protocols used and how information flows through the numerous channels has changed greatly since the Internet's foundation, yet since the concept of public key encryption was first proposed, it has used an authentication function to secure communications. It has been shown that the present scheme is insecure allowing possible leaks of sensitive data.
Information should be protected and not leaked to strangers. This article proposes a solution to this very serious problem.
We present an improvement to concast authentication in signature protocols, which will prevent forgery attacks. Users do not divulge their secret key but still get authenticated based on a multicast or concast network environment.

Keywords: Concast communication, Digital signature, Discrete logarithm problem, Forgery attack

1. Introduction
Users of the basic digital signature scheme just assume that their messages are confidential and are ignorant of the possible dangers and weaknesses inherent in the underlying protocol. Any digital transaction can be the subject of an attack; and therefore non repudiation cannot be guaranteed to work. If an enterprise finds out that a key has been compromised, then it will be a time consuming and expensive task to identify all bogus messages and indeed contracts in their system. Obviously this is a matter of grave importance and our article seeks to eradicate these weaknesses. In the past, Al-Ibrahim, Ghodosi and Pieprzyk proposed several methods of batch signature verification suitable for concast communication (Al-Ibrahim et al., 2002). These schemes are all based on El-Gamal-type signature schemes. Stinson has proved that their preferred scheme, which does not require interaction among the various signers, is insecure.
We propose an improvement scheme of concast authentication in signature protocol. We point out how to efficiently protect this system. In Section 2, we review and discuss concast authenticated communication. In Section 3, we analyze the forgery attack discovered by Stinson (Stinson, 2004). In Section 4, we propose an improved scheme to defend against forgery attacks. Section 5 is our conclusion.

※ 这篇主要是改进 Authentication of Concast Communication 原本的 scheme,来防止 S. R. Stinson 教授的 attack。 这篇也是我在 digital singature 领域的得意作品之一。
上传的附件:
2009-5-28 01:30
0
游客
登录 | 注册 方可回帖
返回
//