Efficient Non-interactive Universally Composable String-Commitment Schemes

Authors:
Ryo Nishimaki;Eiichiro Fujisaki;Keisuke Tanaka
Affiliations:
NTT, Tokyo, Japan 180-8585 and Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan 152-8552;NTT, Tokyo, Japan 180-8585;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan 152-8552
Venue:
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Year:
2009

Citing 17
Cited 7

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Nonmalleable Cryptography

SIAM Journal on Computing
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Non-interactive and reusable non-malleable commitment schemes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
New notions of security: achieving universal composability without trusted setup

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Universally Composable Protocols with Relaxed Set-Up Assumptions

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Journal of Cryptology
Cryptography from Sunspots: How to Use an Imperfect Reference String

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Lossy trapdoor functions and their applications

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

SIAM Journal on Computing
Universally Composable Multi-party Computation Using Tamper-Proof Hardware

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
New Constructions for Reusable, Non-erasure and Universally Composable Commitments

ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Universally composable security with global setup

TCC'07 Proceedings of the 4th conference on Theory of cryptography

General construction of chameleon all-but-one trapdoor functions

ProvSec'11 Proceedings of the 5th international conference on Provable security
CCA proxy re-encryption without bilinear maps in the standard model

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
More constructions of lossy and correlation-secure trapdoor functions

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Non-interactive and re-usable universally composable string commitments with adaptive security

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Lossy functions do not amplify well

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
All-But-Many lossy trapdoor functions

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Dual projective hashing and its applications -- lossy trapdoor functions and more

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The universal composability (UC) for commitment is a very strong security notion. It guarantees that commitment schemes remain secure even if they are composed with arbitrary protocols and polynomially many copies of the schemes are run concurrently. Several UC commitment schemes in the common reference string (CRS) model have been proposed, but, they are either interactive commitment or bit-commitment (not string-commitment) schemes. We propose new non-interactive string-commitment schemes that achieve UC security in the CRS model assuming the difficulty of the decisional Diffie-Hellman problem or the decisional composite residuosity problem, but our schemes are not reusable. The main building blocks of our constructions are all-but-one trapdoor functions (ABO-TDFs) introduced by Peikert and Waters in STOC 2008 to construct secure public-key encryption schemes. Our main idea is to use the homomorphic properties of the function indices of the all-but-one trapdoor functions and to extend the functions to probabilistic ones by using re-randomization of ciphertexts. This is a new application of ABO-TDFs.