Round optimal black-box ``commit-and-prove'' (Q1629413): Difference between revisions

@@ Property / cites work @@
+How to Efficiently Evaluate RAM Programs with Malicious Security
+Normal rank
@@ Property / cites work @@
+Computationally private randomizing polynomials and their applications
+Normal rank
@@ Property / cites work @@
+Universally composable two-party and multi-party secure computation
+Normal rank
@@ Property / cites work @@
+Simple, Black-Box Constructions of Adaptively Secure Protocols
+Normal rank
@@ Property / cites work @@
+Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
+Normal rank
@@ Property / cites work @@
+The Exact Round Complexity of Secure Computation
@@ Property / cites work: The Exact Round Complexity of Secure Computation / rank @@
+Normal rank
@@ Property / cites work @@
+How to construct constant-round zero-knowledge proof systems for NP
+Normal rank
@@ Property / cites work @@
+On the Composition of Zero-Knowledge Proof Systems
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+Constant round non-malleable protocols using one way functions
+Normal rank
@@ Property / cites work @@
+Black-box non-black-box zero knowledge
@@ Property / cites work: Black-box non-black-box zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Textbook non-malleable commitments
@@ Property / cites work: Textbook non-malleable commitments / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
+Normal rank
@@ Property / cites work @@
+Efficient secure two-party protocols. Techniques and constructions
+Normal rank
@@ Property / cites work @@
+On the Power of Secure Two-Party Computation
@@ Property / cites work: On the Power of Secure Two-Party Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
+Normal rank
@@ Property / cites work @@
+Amortizing Garbled Circuits
@@ Property / cites work: Amortizing Garbled Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Black-box constructions for secure computation
@@ Property / cites work: Black-box constructions for secure computation / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Non-interactive Secure Computation
@@ Property / cites work: Efficient Non-interactive Secure Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549593
@@ Property / cites work: Q3549593 / rank @@
+Normal rank
@@ Property / cites work @@
+Founding Cryptography on Oblivious Transfer – Efficiently
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology – CRYPTO 2004
@@ Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
+Normal rank
@@ Property / cites work @@
+An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
+Normal rank
@@ Property / cites work @@
+Secure two-party computation via cut-and-choose oblivious transfer
+Normal rank
@@ Property / cites work @@
+LEGO for Two-Party Secure Computation
@@ Property / cites work: LEGO for Two-Party Secure Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Round-Optimal Black-Box Two-Party Computation
@@ Property / cites work: Round-Optimal Black-Box Two-Party Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
+Normal rank
@@ Property / cites work @@
+Black-Box Constructions of Two-Party Protocols from One-Way Functions
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Must You Know the Code of f to Securely Compute f?
+Normal rank
@@ Property / cites work @@
+Two-Output Secure Computation with Malicious Adversaries
+Normal rank
@@ Property / cites work @@
+Revisiting the Efficiency of Malicious Two-Party Computation
+Normal rank