%0 Conference Paper %1 DBLP:conf/crypto/DamgardN00 %A Damg\aard, Ivan %A Nielsen, Jesper Buus %B CRYPTO %D 2000 %E Bellare, Mihir %I Springer %K crypto non-committing_encryption %P 432-450 %R 10.1007/3-540-44598-6_27 %T Improved Non-committing Encryption Schemes Based on a General Complexity Assumption %V 1880 %X Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private channels between players are not assumed. While any non-committing encryption scheme must be secure in the ordinary semantic sense, the converse is not necessarily true. We propose a construction of non-committing encryption that can be based on any public-key system which is secure in the ordinary sense and which has an extra property we call simulatability. This generalises an earlier scheme proposed by Beaver based on the Diffie-Hellman problem, and we propose another implementation based on RSA. In a more general setting, our construction can be based on any collection of trapdoor permutations with a certain simulatability property. This offers a considerable efficiency improvement over the first non-committing encryption scheme proposed by Canetti et al. Finally, at some loss of efficiency, our scheme can be based on general collections of trapdoor permutations without the simulatability assumption, and without the common-domain assumption of Canetti et al. In showing this last result, we identify and correct a bug in a key generation protocol from Canetti et al. %@ 3-540-67907-3

@inproceedings{DBLP:conf/crypto/DamgardN00, abstract = {Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private channels between players are not assumed. While any non-committing encryption scheme must be secure in the ordinary semantic sense, the converse is not necessarily true. We propose a construction of non-committing encryption that can be based on any public-key system which is secure in the ordinary sense and which has an extra property we call simulatability. This generalises an earlier scheme proposed by Beaver based on the Diffie-Hellman problem, and we propose another implementation based on RSA. In a more general setting, our construction can be based on any collection of trapdoor permutations with a certain simulatability property. This offers a considerable efficiency improvement over the first non-committing encryption scheme proposed by Canetti et al. Finally, at some loss of efficiency, our scheme can be based on general collections of trapdoor permutations without the simulatability assumption, and without the common-domain assumption of Canetti et al. In showing this last result, we identify and correct a bug in a key generation protocol from Canetti et al.}, added-at = {2009-10-02T22:42:26.000+0200}, author = {Damg{\aa}rd, Ivan and Nielsen, Jesper Buus}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/25b4cdff462f659656cd01f3cc49c1a51/ytyoun}, booktitle = {CRYPTO}, crossref = {DBLP:conf/crypto/2000}, doi = {10.1007/3-540-44598-6_27}, editor = {Bellare, Mihir}, interhash = {89ec2f18820a4a0893504971e4859c8d}, intrahash = {5b4cdff462f659656cd01f3cc49c1a51}, isbn = {3-540-67907-3}, keywords = {crypto non-committing_encryption}, pages = {432-450}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2016-06-14T14:32:16.000+0200}, title = {Improved Non-committing Encryption Schemes Based on a General Complexity Assumption}, volume = 1880, year = 2000 }