Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008 > Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008 |
Josef Pawel Pieprzyk
Springer Berlin Heidelberg
Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Authors

Xiaoming Sun; Andrew Chi-Chih Yao; Christophe Tartary

ARI Id

1664820861270_3654352

Access

Not Available Free

Pages

37-53

DOI

10.1007/978-3-540-89255-7_3

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-89255-7_3

Table of Contents of Book
Showing 1 to 20 of 36 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
MPC vs. SFE: Unconditional and Computational Security
Martin Hirt; Ueli Maurer; Vassilis Zikas
1-18
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Zhifang Zhang; Mulan Liu; Yeow Meng Chee; San Ling; Huaxiong Wang
19-36
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Xiaoming Sun; Andrew Chi-Chih Yao; Christophe Tartary
37-53
Some Perspectives on Complexity-Based Cryptography
Andrew Chi-Chih Yao
54-54
A Modular Security Analysis of the TLS Handshake Protocol
P. Morrissey; N. P. Smart; B. Warinschi
55-73
Ambiguous Optimistic Fair Exchange
Qiong Huang; Guomin Yang; Duncan S. Wong; Willy Susilo
74-89
Compact Proofs of Retrievability
Hovav Shacham; Brent Waters
90-107
On the Security of HB# against a Man-in-the-Middle Attack
Khaled Ouafi; Raphael Overbeck; Serge Vaudenay
108-124
Hash Functions from Sigma Protocols and Improvements to VSH
Mihir Bellare; Todor Ristov
125-142
Slide Attacks on a Class of Hash Functions
Michael Gorski; Stefan Lucks; Thomas Peyrin
143-160
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
Ueli Maurer; Stefano Tessaro
161-178
Universally Composable Adaptive Oblivious Transfer
Matthew Green; Susan Hohenberger
179-197
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
Jason Keller; Joe Kilian
198-215
Towards Robust Computation on Encrypted Data
Manoj Prabhakaran; Mike Rosulek
216-233
Efficient Protocols for Set Membership and Range Proofs
Jan Camenisch; Rafik Chaabouni; abhi shelat
234-252
Preimage Attacks on 3, 4, and 5-Pass HAVAL
Yu Sasaki; Kazumaro Aoki
253-271
How to Fill Up Merkle-Damgård Hash Functions
Kan Yasuda
272-289
Limits of Constructive Security Proofs
Michael Backes; Dominique Unruh
290-307
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Goichiro Hanaoka; Kaoru Kurosawa
308-325
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 36 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings