Communications of the ACM
Efficient Non-malleable Commitment Schemes
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Efficient and Non-interactive Non-malleable Commitment
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Non-malleable Statistically Hiding Commitment from Any One-Way Function
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Adaptively secure non-interactive threshold cryptosystems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient lattice (H)IBE in the standard model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
A multi-committer threshold commitment scheme is proposed based on the intractability assumption of Learning with errors problem. A group of committers consult a secret and divide it into several share pieces. Each member possesses a share piece. When de-committing, if a committer doesn't want to admit or reveal the secret, he may refuse to open his piece, or even he may send an improper piece purposely when corrupted by a malicious adversary. If a majority of the committers agree to contribute their correct pieces, the receiver will accept the secret. The core idea is threshold secret share. This scheme satisfies the necessary properties, such as binding, hiding, non-malleability, and adaptive corruption chosen-plaintext security against malicious adversary. The commitment expansion factor is as small as O(log2 q) so as to communicate efficiently.