Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947): Difference between revisions

@@ Property / author @@
-Ivan B. Damgård
@@ Property / author: Ivan B. Damgård / rank @@
-Normal rank
@@ Property / author @@
+Ivan B. Damgård
@@ Property / author: Ivan B. Damgård / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MiniLEGO
@@ Property / describes a project that uses: MiniLEGO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-53015-3_7
+Normal rank
@@ Property / OpenAlex ID @@
+W2493644741
@@ Property / OpenAlex ID: W2493644741 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Efficiently Evaluate RAM Programs with Malicious Security
+Normal rank
@@ Property / cites work @@
+Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
+Normal rank
@@ Property / cites work @@
+Very-Efficient Simulatable Flipping of Many Coins into a Well
+Normal rank
@@ Property / cites work @@
+Additively Homomorphic UC Commitments with Optimal Amortized Overhead
+Normal rank
@@ Property / cites work @@
+Q4783717
@@ Property / cites work: Q4783717 / rank @@
+Normal rank
@@ Property / cites work @@
+Universally composable two-party and multi-party secure computation
+Normal rank
@@ Property / cites work @@
+Randomness conductors and constant-degree lossless expanders
+Normal rank
@@ Property / cites work @@
+Compact VSS and Efficient Homomorphic UC Commitments
+Normal rank
@@ Property / cites work @@
+Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
+Normal rank
@@ Property / cites work @@
+MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
+Normal rank
@@ Property / cites work @@
+On the Complexity of Additively Homomorphic UC Commitments
+Normal rank
@@ Property / cites work @@
+Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
+Normal rank
@@ Property / cites work @@
+Linear time encodable and list decodable codes
@@ Property / cites work: Linear time encodable and list decodable codes / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
+Normal rank
@@ Property / cites work @@
+On the Complexity of UC Commitments
@@ Property / cites work: On the Complexity of UC Commitments / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549728
@@ Property / cites work: Q3549728 / rank @@
+Normal rank
@@ Property / cites work @@
+Founding Cryptography on Oblivious Transfer – Efficiently
+Normal rank
@@ Property / cites work @@
+Secure Arithmetic Computation with No Honest Majority
+Normal rank
@@ Property / cites work @@
+Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
+Normal rank
@@ Property / cites work @@
+Bit commitment using pseudorandomness
@@ Property / cites work: Bit commitment using pseudorandomness / rank @@
+Normal rank
@@ Property / cites work @@
+A Framework for Efficient and Composable Oblivious Transfer
+Normal rank
@@ Property / cites work @@
+Linear-time encodable and decodable error-correcting codes
+Normal rank
@@ Property / cites work @@
+Characterizing pseudoentropy and simplifying pseudorandom generator constructions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2829947