Relationship of Three Cryptographic Channels in the UC Framework

Authors:
Waka Nagao;Yoshifumi Manabe;Tatsuaki Okamoto
Affiliations:
Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Kyoto, Japan 606-8501;Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Kyoto, Japan 606-8501 and NTT Labs, Nippon Telegraph and Telephone Corporation, Tokyo, Japan 180-8585;Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Kyoto, Japan 606-8501 and NTT Labs, Nippon Telegraph and Telephone Corporation, Tokyo, Japan 180-8585
Venue:
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Year:
2008

Citing 10
Cited 2

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the Relationship among Cryptographic Physical Assumptions

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Time-bounded task-PIOAs: a framework for analyzing security protocols

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Indifferentiable security reconsidered: role of scheduling

ISC'10 Proceedings of the 13th international conference on Information security
Universally composable security with local adversaries

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relationship of three cryptographic channels, secure channels (SC), anonymous channels (AC) and direction-indeterminable channels (DIC), was investigated by Okamoto. He showed that the three cryptographic channels are reducible to each other, but did not consider communication schedules clearly as well as composable security. This paper refines the relationship of the three channels in the light of communication schedules and composable security. We model parties by the task-probabilistic input/output automata (PIOA) to treat communication schedules, and adopt the universally composable (UC) framework by Canetti to treat composable security. We show that a class of anonymous channels, two-anonymous channels (2AC), and DIC are reducible to each other under any schedule and that DIC and SC are reducible to each other under some types of schedules, in the UC framework with the PIOA model.