Rate-1, Linear Time and Additively Homomorphic UC Commitments
- 21 July 2016
- book chapter
- Published by Springer Nature
- Vol. 2016, 179-207
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes2013
- MiniLEGO: Efficient Secure Two-Party Computation from General AssumptionsLecture Notes in Computer Science, 2013
- Highly-Efficient Universally-Composable Commitments Based on the DDH AssumptionLecture Notes in Computer Science, 2011
- Secure Arithmetic Computation with No Honest Majority2009
- Founding Cryptography on Oblivious Transfer – Efficiently2008
- A Framework for Efficient and Composable Oblivious Transfer2008
- Linear-Time Encodable/Decodable Codes With Near-Optimal RateIEEE Transactions on Information Theory, 2005
- Universally Composable Commitments2001
- Linear-time encodable and decodable error-correcting codesIEEE Transactions on Information Theory, 1996
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991