Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
39
views
30
references
Top references
cited by
12
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,636
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Proceedings
OT-Combiners via Secure Computation
other
Author(s):
Danny Harnik
,
Yuval Ishai
,
Eyal Kushilevitz
,
Jesper Buus Nielsen
Publication date
(Print):
2008
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
ScienceOpen Research
Most cited references
30
Record
: found
Abstract
: not found
Article
: not found
Conjugate coding
Stephen Wiesner
(1983)
0
comments
Cited
361
times
– based on
0
reviews
Review now
Bookmark
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
Article
: not found
Security and Composition of Multiparty Cryptographic Protocols
Ran Canetti
(2000)
0
comments
Cited
155
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2008
Pages
: 393-411
DOI:
10.1007/978-3-540-78524-8_22
SO-VID:
88984733-6003-4b44-80b1-1c3dda85439f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
pp. 19
On Seed-Incompressible Functions
pp. 37
Asymptotically Efficient Lattice-Based Digital Signatures
pp. 55
Basing Weak Public-Key Cryptography on Strong One-Way Functions
pp. 73
Which Languages Have 4-Round Zero-Knowledge Proofs?
pp. 89
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
pp. 107
General Properties of Quantum Zero-Knowledge Proofs
pp. 125
The Layered Games Framework for Specifications and Analysis of Security Protocols
pp. 142
Universally Composable Multi-party Computation with an Unreliable Common Reference String
pp. 155
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
pp. 176
Fast Private Norm Estimation and Heavy Hitters
pp. 194
Matroids Can Be Far from Ideal Secret Sharing
pp. 213
Perfectly-Secure MPC with Linear Communication Complexity
pp. 231
MPC vs. SFE: Perfect Security in a Unified Corruption Model
pp. 251
Bridging Game Theory and Cryptography: Recent Results and Future Directions
pp. 273
Verifiably Secure Devices
pp. 302
Lower Bounds on Implementing Robust and Resilient Mediators
pp. 320
Cryptography and Game Theory: Designing Protocols for Exchanging Information
pp. 340
Equivocal Blind Signatures and Adaptive UC-Security
pp. 356
P-signatures and Noninteractive Anonymous Credentials
pp. 375
Multi-property Preserving Combiners for Hash Functions
pp. 393
OT-Combiners via Secure Computation
pp. 412
Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
pp. 427
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
pp. 445
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
pp. 465
Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
pp. 482
An Equivalence Between Zero Knowledge and Commitments
pp. 501
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
pp. 535
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
pp. 553
On Constant-Round Concurrent Zero-Knowledge
pp. 571
Concurrent Non-malleable Commitments from Any One-Way Function
pp. 589
Faster and Shorter Password-Authenticated Key Exchange
pp. 607
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
pp. 626
Degradation and Amplification of Computational Hardness
Similar content
3,636
Spectroscopic Properties of Fluoroquinolone Antibiotics and Nanosecond Solvation Dynamics in Aerosol-OT Reverse Micelles
Authors:
Hyoung-Ryun Park
,
Hyeong-Chul Lee
,
Tae H. Kim
…
Evromaidan imeni Stepana Bandery. Ot demokratii k diktature
Authors:
Byshok S.
Occupational Therapy (OT) frequently asked questions
Authors:
See all similar
Cited by
12
Founding Cryptography on Oblivious Transfer – Efficiently
Authors:
Yuval Ishai
,
Manoj Prabhakaran
,
Amit Sahai
A New Approach to Practical Active-Secure Two-Party Computation
Authors:
Jesper Nielsen
,
Peter Nordholt
,
Claudio Orlandi
…
MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
Authors:
Tore Kasper Frederiksen
,
Thomas Pelle Jakobsen
,
Jesper Nielsen
…
See all cited by