Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2015-11-22 02:25:22
Open Document
File Size: 228,49 KB
Share Result on Facebook
Multi-Party Computation with Small Shuffle Complexity Using Regular Polygon Cards Kazumasa Shinagawa (Univ. Tsukuba) Jacob Schuldt (AIST) Naoki Kanayama (Univ. Tsukuba)