A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477): Difference between revisions

@@ Property / cites work @@
+More Efficient Match-Making and Satisfiability The Five Card Trick
+Normal rank
@@ Property / cites work @@
+Q4341757
@@ Property / cites work: Q4341757 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure grouping protocol using a deck of cards
@@ Property / cites work: Secure grouping protocol using a deck of cards / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
+Normal rank
@@ Property / cites work @@
+Card-Based Cryptographic Protocols Using a Minimal Number of Cards
+Normal rank
@@ Property / cites work @@
+Improved Garbled Circuit: Free XOR Gates and Applications
+Normal rank
@@ Property / cites work @@
+Six-Card Secure AND and Four-Card Secure XOR
@@ Property / cites work: Six-Card Secure AND and Four-Card Secure XOR / rank @@
+Normal rank
@@ Property / cites work @@
+Card-Based Protocols for Any Boolean Function
@@ Property / cites work: Card-Based Protocols for Any Boolean Function / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards
+Normal rank
@@ Property / cites work @@
+Two Halves Make a Whole
@@ Property / cites work: Two Halves Make a Whole / rank @@
+Normal rank