Abstract is missing.
- Guessing SecrecyMohsen Alimomeni, Reihaneh Safavi-Naini. 1-13 [doi]
- Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest MajorityAnne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp. 14-36 [doi]
- Two Protocols for Delegation of ComputationRan Canetti, Ben Riva, Guy N. Rothblum. 37-61 [doi]
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative RelationsRonald Cramer, Ivan Damgård, Valerio Pastro. 62-79 [doi]
- Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece AssumptionsBernardo Machado David, Anderson C. A. Nascimento, Jörn Müller-Quade. 80-99 [doi]
- Shannon Impossibility, RevisitedYevgeniy Dodis. 100-110 [doi]
- Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function EvaluationNico Döttling, Daniel Kraschewski, Jörn Müller-Quade. 111-128 [doi]
- Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract)Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub. 129-146 [doi]
- Efficient Threshold Zero-Knowledge with Applications to User-Centric ProtocolsMarcel Keller, Gert Læssøe Mikkelsen, Andy Rupp. 147-166 [doi]
- Information-Theoretic Timed-Release Security: Key-Agreement, Encryption, and Authentication CodesYohei Watanabe, Takenobu Seito, Junji Shikata. 167-186 [doi]
- Optimum General Threshold Secret SharingMaki Yoshida, Toru Fujiwara, Marc P. C. Fossorier. 187-204 [doi]