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
149
views
43
references
Top references
cited by
22
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,748
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory of Cryptography
Secure Arithmetic Computation with No Honest Majority
other
Author(s):
Yuval Ishai
,
Manoj Prabhakaran
,
Amit Sahai
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
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
ScienceOpen Research
Most cited references
43
Record
: found
Abstract
: not found
Book Chapter
: not found
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Pascal Paillier
(1999)
0
comments
Cited
376
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Universally composable security: a new paradigm for cryptographic protocols
R. Canetti
(2025)
0
comments
Cited
236
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Improved decoding of Reed-Solomon and algebraic-geometry codes
V. Guruswami
,
M. Sudan
(1999)
0
comments
Cited
135
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 294-314
DOI:
10.1007/978-3-642-00457-5_18
SO-VID:
a1cd6771-e2b2-41df-99f7-590ef1e97094
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
An Optimally Fair Coin Toss
pp. 91
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
pp. 238
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
pp. 19
Complete Fairness in Multi-party Computation without an Honest Majority
pp. 36
Fairness with an Honest Minority and a Rational Majority
pp. 202
On the (Im)Possibility of Key Dependent Encryption
pp. 294
Secure Arithmetic Computation with No Honest Majority
pp. 350
Composing Quantum Protocols in a Classical Environment
pp. 368
LEGO for Two-Party Secure Computation
pp. 419
Chosen-Ciphertext Security via Correlated Products
pp. 437
Hierarchical Identity Based Encryption with Polynomially Many Levels
pp. 457
Predicate Privacy in Encryption Systems
pp. 474
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
pp. 496
The Differential Privacy Frontier (Extended Abstract)
pp. 503
How Efficient Can Memory Checking Be?
pp. 577
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
Similar content
4,748
“Arithmetical extensions of relational systems”
Authors:
A Tarki
,
Vaugth
Arithmetic formulae and the use of subroutines in SAKO
Authors:
A.W. Mazurkiewicz
Brain potentials during mental arithmetic-effects of problem difficulty on event-related brain potentials.
Authors:
Jian Kong
,
Yuping Wang
,
Hongyan Shang
…
See all similar
Cited by
22
A New Approach to Practical Active-Secure Two-Party Computation
Authors:
Jesper Nielsen
,
Peter Nordholt
,
Claudio Orlandi
…
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Authors:
Yehuda Lindell
,
Benny Pinkas
From Secrecy to Soundness: Efficient Verification via Secure Computation
Authors:
Benny Applebaum
,
Yuval Ishai
,
Eyal Kushilevitz
See all cited by