Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
77
views
38
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,051
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Verifying Concurrent Processes Using Temporal Logic
Round-Optimal Secure Multi-Party Computation
other
Author(s):
Shai Halevi
,
Carmit Hazay
,
Antigoni Polychroniadou
,
Muthuramakrishnan Venkitasubramaniam
Publication date
(Online):
July 24 2018
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
International Journal of Automation & Digital Transformation
Most cited references
38
Record
: found
Abstract
: not found
Conference Proceedings
: not found
How to generate and exchange secrets
Andrew Yao
(1986)
0
comments
Cited
307
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
How to play ANY mental game
O Goldreich
,
S Micali
,
A. Wigderson
(1987)
0
comments
Cited
136
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Michael Ben-Or
,
Avi Wigderson
(1988)
0
comments
Cited
94
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
July 24 2018
Pages
: 488-520
DOI:
10.1007/978-3-319-96881-0_17
SO-VID:
a6e97e88-e8e1-411c-adcc-65bc893680c8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Introduction
pp. 1
Introduction
pp. 3
Simplifying Game-Based Definitions
pp. 13
Review of the theories on agents as intentional systems
pp. 3
Programming environment
pp. 33
The Algebraic Group Model and its Applications
pp. 15
Verification
pp. 51
A formal theory of commitments
pp. 65
On Tightly Secure Non-Interactive Key Exchange
pp. 27
Temporal logic
pp. 83
Specification of reasoning behind interactions
pp. 95
Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange
pp. 101
Modelling interactions in COSY agent architecture
pp. 129
Fast Correlation Attack Revisited
pp. 36
Chapter 5. Techniques
pp. 133
Summary and conclusion
pp. 160
A Key-Recovery Attack on 855-round Trivium
pp. 70
Network protocols
pp. 157
Resource allocation
pp. 185
Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities
pp. 183
Conclusion
pp. 213
Bernstein Bound on WCS is Tight
pp. 241
Correcting Subverted Random Oracles
pp. 272
Combiners for Backdoored Random Oracles
pp. 303
On Distributional Collision Resistant Hashing
pp. 331
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries
pp. 362
Trapdoor Functions from the Computational Diffie-Hellman Assumption
pp. 395
Round-Optimal Secure Multiparty Computation with Honest Majority
pp. 425
On the Exact Round Complexity of Secure Three-Party Computation
pp. 459
Promise Zero Knowledge and Its Applications to Round Optimal MPC
pp. 488
Round-Optimal Secure Multi-Party Computation
pp. 523
Yes, There is an Oblivious RAM Lower Bound!
pp. 543
Constrained PRFs for \(\mathrm{NC}^1\) in Traditional Groups
pp. 577
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
pp. 608
Lower Bounds on Lattice Enumeration with Extreme Pruning
pp. 638
Dissection-BKW
pp. 669
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
pp. 700
Lattice-Based Zero-Knowledge Arguments for Integer Relations
pp. 769
SPD\(\mathbb {Z}_{2^k}\): Efficient MPC mod \(2^k\) for Dishonest Majority
pp. 799
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
Similar content
2,051
Development of individual competencies and team performance in interprofessional ward rounds: results of a study with multimodal observations at the Heidelberg Interprofessional Training Ward
Authors:
Anika Mitzkat
,
Johanna Mink
,
Christine Arnold
…
Prevalence of major depressive disorder and its determinants among young married women and unmarried girls: Findings from the second round of UDAYA survey
Authors:
Shromona Dhara
,
Joyeeta Thakur
,
Neelanjana Pandey
…
The Invasive Round Goby Neogobius melanostomus as a Potential Threat to Native Crayfish Populations.
Authors:
Pavel Franta
,
Radek Gebauer
,
Lukáš Veselý
…
See all similar
Cited by
1
On the Round Complexity of Black-Box Secure MPC
Authors:
Yuval Ishai
,
Dakshita Khurana
,
Amit Sahai
…
See all cited by