Multi-Party Computation with Small Shuffle Complexity Using Regular Polygon Cards Kazumasa Shinagawa (Univ. Tsukuba) Jacob Schuldt (AIST) Naoki Kanayama (Univ. Tsukuba)

First Page		Document Content
Date: 2015-11-22 02:25:22 Shuffle		Multi-Party Computation with Small Shuffle Complexity Using Regular Polygon Cards Kazumasa Shinagawa (Univ. Tsukuba) Jacob Schuldt (AIST) Naoki Kanayama (Univ. Tsukuba) Add to Reading List Source URL: security-lab.jaist.ac.jp Download Document from Source Website File Size: 228,49 KB Share Document on Facebook