000204747 001__ 204747
000204747 005__ 20190317000101.0
000204747 037__ $$aCONF
000204747 245__ $$aCompact and Efficient UC Commitments under Atomic-Exchanges
000204747 269__ $$a2014
000204747 260__ $$c2014
000204747 336__ $$aConference Papers
000204747 520__ $$aWe devise a multiple (concurrent) commitment scheme operating on large messages. It uses an ideal global setup functionality in a minimalistic way. The commitment phase is non-interactive. It is presented in a modular way so that the internal building blocks could easily be replaced by others and/or isolated during the process of design and implementation. Our optimal instantiation is based on the decisional Diffie-Hellman (DDH) assumption and the (adversarially selected group) Diffie-Hellman knowledge (DHK) assumption which was proposed at CRYPTO 1991. It achieves UC security against static attacks in an efficient way. Indeed, it is computationally cheaper than Lindell's highly efficient UC commitment based on common reference strings and on DDH from EUROCRYPT 2011.
000204747 700__ $$aBoureanu, Ioana
000204747 700__ $$g131602$$aVaudenay, Serge$$0241950
000204747 7112_ $$dDecember 3-5, 2014$$cSeoul, Korea$$a17th Annual International Conference on Information Security and Cryptology
000204747 8564_ $$uhttps://infoscience.epfl.ch/record/204747/files/auc2_pk.pdf$$zn/a$$s220830$$yn/a
000204747 909C0 $$xU10433$$0252183$$pLASEC
000204747 909CO $$ooai:infoscience.tind.io:204747$$qGLOBAL_SET$$pconf$$pIC
000204747 917Z8 $$x200065
000204747 937__ $$aEPFL-CONF-204747
000204747 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000204747 980__ $$aCONF