Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the Complexity of Additively Homomorphic UC Commitments

Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti

Published Dec 18, 2015• 32 citations
Publisher
DOI
10.1007/978-3-662-49096-9_23

Related papers

Additively Homomorphic UC Commitments with Optimal Amortized Overhead

Ignacio Cascudo, Ivan Damgård, Bernardo David +3 more

Lecture notes in computer science•Jan 1, 2015•24 citations

Rate-1, Linear Time and Additively Homomorphic UC Commitments

Ignacio Cascudo, Ivan Damgård, Bernardo David +2 more

Lecture notes in computer science•Jan 1, 2016•27 citations

Efficient UC Commitment Extension with Homomorphism for Free (and Applications)

Ignacio Cascudo, Ivan Damgård, Bernardo David +3 more

Lecture notes in computer science•Jan 1, 2019•12 citations

On the Complexity of UC Commitments

Juan A. Garay, Yuval Ishai, Ranjit Kumaresan +1 more

Lecture notes in computer science•Jan 1, 2014•24 citations

Unconditionally secure homomorphic pre-distributed commitments

Anderson C. A. Nascimento, Joern Mueller-Quade, Akira Otsuka +1 more

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•2 citations

Compact and Efficient UC Commitments Under Atomic-Exchanges

Ioana Boureanu, Serge Vaudenay B

Lecture notes in computer science•Jan 1, 2015•1 citation