On the Security of Multi-Party Ping-Pong Protocols

On the Security of Multi-Party Ping-Pong Protocols (1985)

Cached

Download Links

[www.wisdom.weizmann.ac.il]

Other Repositories/Bibliography

DBLP

by Shimon Even , Oded Goldreich

Citations:

51 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On the Security of Multi-Party Ping-Pong Protocols	INFERENCE
AUTHOR NAME	Shimon Even	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; Technion- Israel Institute of Technology; Haifa, Israel.	SVM HeaderParse 0.2
AUTHOR NAME	Oded Goldreich	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; and Applied Mathematics; Weizmann Institute of Science; Rehovot, Israel.	SVM HeaderParse 0.2
ABSTRACT	This paper is concerned with the model for security of cryptographic protocols suggested by Dolev and Yao. The Dolev and Yao model deals with a restricted class of protocols, known as Two-Party Ping-Pong Protocols. In such a protocol, messages are exchanged in a memoryless manner. That is, the message sent by each party results from applying a predetermined operator to the message he has received. The Dolev and Yao model is presented, generalized in various directions and the affect of these generalizations is extensively studied. First, the model is trivially generalized to deal with multi-party ping-pong protocols. However, the problems which arise from this generalization are very far from being trivial. In particular, it is no longer clear how many saboteurs (adversaries) should be considered when testing the security of p-party ping-pong protocols. We demonstrate an upper bound of 3(p \Gamma 2) + 2 and a lower bound of 3(p \Gamma 2) + 1 on this number. Thus, for every fixed p, th...	user correction - Legacy Corrections
YEAR	1985	user correction - Legacy Corrections
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	34--39	INFERENCE
TECH	Technical Report 285, Technion	INFERENCE
CITATIONS	20 found	ParsCit 1.0