Adaptive and composable non-committing encryptions

Authors:
Huafei Zhu;Tadashi Araragi;Takashi Nishide;Kouichi Sakurai
Affiliations:
Institute for Infocomm Research, A-STAR, Singapore;NTT Communication Science Laboratories, Kyoto, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan
Venue:
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Year:
2010

Citing 14
Cited 2

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Plug and Play Encryption

CRYPTO '97 Proceedings of the 17th 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
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Cryptographic protocols provably secure against dynamic adversaries

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Public-key encryptions tolerating adaptive and composable adversaries

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Error-free, multi-bit non-committing encryption with constant round complexity

Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the proposed non-committing scheme realizes the UCsecurity in the presence of adaptive adversary assuming that the decisional Diffie-Hellman problem is hard.