A non-committing encryption scheme based on quadratic residue

Authors:
Feiyu Lei;Wen Chen;Kefei Chen
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 14
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth 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
Multi party computations: past and present

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Handbook of Applied Cryptography

Handbook of Applied Cryptography
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
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Secure Computation (Abstract)

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing

CRYPTO '91 Proceedings of the 11th 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
Probabilistic encryption & how to play mental poker keeping secret all partial information

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Modern Cryptography: Theory and Practice

Modern Cryptography: Theory and Practice
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Cryptographic protocols provably secure against dynamic adversaries

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

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

This paper presents a non-committing encryption scheme based on quadratic residue. It is a solution to adaptive security of multiparty computation with non-erasing parties in the cryptographic model. The scheme is more efficient than all previous non-committing encryption schemes. Furthermore, we give security proofs.