![Computational complexity theory / Complexity classes / Cryptographic protocols / Secure multi-party computation / Universal composability / Digital signature / Parallel computing / Advanced Boolean Expression Language / PP / P / NC Computational complexity theory / Complexity classes / Cryptographic protocols / Secure multi-party computation / Universal composability / Digital signature / Parallel computing / Advanced Boolean Expression Language / PP / P / NC](https://www.pdfsearch.io/img/c0d657f4ea241bbdaf475dc73265ed7c.jpg) Date: 2017-03-17 12:02:53Computational complexity theory Complexity classes Cryptographic protocols Secure multi-party computation Universal composability Digital signature Parallel computing Advanced Boolean Expression Language PP P NC | | Secure Multiparty Computation from SGX? Raad Bahmani1 , Manuel Barbosa2 , Ferdinand Brasser1 , Bernardo Portela2 , Ahmad-Reza Sadeghi1 , Guillaume Scerri3 , and Bogdan Warinschi4 1 Technische Universität DarmstadtAdd to Reading ListSource URL: fc17.ifca.aiDownload Document from Source Website File Size: 455,73 KBShare Document on Facebook
|