The following publications are possibly variants of this publication:
- Rate-1, Linear Time and Additively Homomorphic UC CommitmentsIgnacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen. iacr, 2016:137, 2016. [doi]
- On the Complexity of Additively Homomorphic UC CommitmentsTore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti. iacr, 2015:694, 2015. [doi]
- On the Complexity of Additively Homomorphic UC CommitmentsTore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti. tcc 2016: 542-565 [doi]
- Additively Homomorphic UC Commitments with Optimal Amortized OverheadIgnacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti. pkc 2015: 495-515 [doi]
- Additively Homomorphic UC commitments with Optimal Amortized OverheadIgnacio Cascudo, Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti. iacr, 2014:829, 2014. [doi]
- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock PuzzlesZvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta. tcc 2019: 407-437 [doi]
- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock PuzzlesZvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta. iacr, 2019:720, 2019. [doi]
- Compact VSS and Efficient Homomorphic UC CommitmentsIvan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen. iacr, 2014:370, 2014. [doi]
- Compact VSS and Efficient Homomorphic UC CommitmentsIvan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen. asiacrypt 2014: 213-232 [doi]