Abstract is missing.
- A brief history of practical multi-party computationNigel P. Smart. 1-2 [doi]
- Challenges in compiler construction for secure two-party computationAndreas Holzer, Nikolaos P. Karvelas, Stefan Katzenbeisser, Helmut Veith, Martin Franz. 3-6 [doi]
- Lessons learned with PCF: scaling secure computationBenjamin Kreuter, Abhi Shelat. 7-10 [doi]
- Efficient secure computation optimizationRaphael Urmoneit, Florian Kerschbaum. 11-18 [doi]
- Specifying sharemind's arithmetic black boxPeeter Laud, Alisa Pankova, Martin Pettai, Jaak Randmets. 19-22 [doi]
- Domain-polymorphic language for privacy-preserving applicationsDan Bogdanov, Peeter Laud, Jaak Randmets. 23-26 [doi]
- Pinocchio coin: building zerocoin from a succinct pairing-based proof systemGeorge Danezis, Cédric Fournet, Markulf Kohlweiss, Bryan Parno. 27-30 [doi]