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
39
views
20
references
Top references
cited by
15
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,730
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
other
Author(s):
Yuval Ishai
,
Eyal Kushilevitz
Publication date
(Online):
June 25 2002
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
Italian Studies
Most cited references
20
Record
: found
Abstract
: not found
Conference Proceedings
: not found
How to generate and exchange secrets
Andrew Yao
(1986)
0
comments
Cited
308
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
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Founding crytpography on oblivious transfer
Joe Kilian
(1988)
0
comments
Cited
116
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
June 25 2002
Pages
: 244-256
DOI:
10.1007/3-540-45465-9_22
SO-VID:
26398de4-e6e3-45a3-86bf-7d7f8b078a5b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Molecular Assembly and Computation: From Theory to Experimental Demonstrations
pp. 22
Towards a Predictive Computational Complexity Theory
pp. 32
Equivariant Syntax and Semantics
pp. 37
L(A) = L(B)? Decidability Results from Complete Formal Systems
pp. 38
Discrete Tomography: Reconstruction under Periodicity Constraints
pp. 57
Local and Global Methods in Data Mining: Basic Techniques and Open Problems
pp. 69
Program Debugging and Validation Using Semantic Approximations and Partial Specifications
pp. 73
Inapproximability Results for Equations over Finite Groups
pp. 85
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
pp. 98
On Families of Graphs Having a Decidable First Order Theory with Reachability
pp. 123
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
pp. 135
Control Message Aggregation in Group Communication Protocols
pp. 147
Church-Rosser Languages vs. UCFL
pp. 159
Intersection of Regular Languages and Star Hierarchy
pp. 170
On the Construction of Reversible Automata for Reversible Languages
pp. 183
Priority Queues, Pairing, and Adaptive Sorting
pp. 195
Exponential Structures for Efficient Cache-Oblivious Algorithms
pp. 208
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
pp. 220
On the Complexity of Resolution with Bounded Conjunctions
pp. 232
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
pp. 244
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
pp. 257
Exponential Lower Bound for Static Semi-algebraic Proofs
pp. 269
Paths Problems in Symmetric Logarithmic Space
pp. 281
Scheduling Search Procedures
pp. 293
Removable Online Knapsack Problems
pp. 306
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
pp. 318
The Quest for Small Universal Cellular Automata
pp. 330
Hyperbolic Recognition by Graph Automata
pp. 343
Quantum and Stochastic Branching Programs of Bounded Width
pp. 355
Spanning Trees with Bounded Number of Branch Vertices
pp. 366
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
pp. 377
Gossiping with Bounded Size Messages in ad hoc Radio Networks
pp. 390
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences
pp. 401
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
pp. 414
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
pp. 426
Cache Oblivious Distribution Sweeping
pp. 439
One-Probe Search
pp. 451
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
pp. 463
Measuring the Probabilistic Powerdomain
pp. 476
Games Characterizing Levy-Longo Trees
pp. 488
Comparing Functional Paradigms for Exact Real-Number Computation
pp. 501
Random Sampling from Boltzmann Principles
pp. 514
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures
pp. 525
Bialgebraic Modelling of Timed Processes
pp. 537
Testing Labelled Markov Processes
pp. 549
Why Computational Complexity Requires Stricter Martingales
pp. 561
Correspondence Principles for Effective Dimensions
pp. 572
A Total Approach to Partial Algebraic Specification
pp. 585
Axiomatising Divergence
pp. 597
A Spatial Logic for Querying Graphs
pp. 611
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network
pp. 623
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
pp. 633
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
pp. 644
Synthesis of Uninitialized Systems
pp. 657
Infinite-State High-Level MSCs: Model-Checking and Realizability
pp. 669
Universal Inherence of Cycle-Free Context-Free Ambiguity Functions
pp. 681
Histogramming Data Streams with Fast Per-Item Processing
pp. 704
Symbolic Strategy Synthesis for Games on Pushdown Graphs
pp. 716
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
pp. 728
Solving the String Statistics Problem in Time $$ \mathcal{O} $$ (nlogn)
pp. 740
A PTAS for Distinguishing (Sub)string Selection
pp. 752
On the Theory of One-Step Rewriting in Trace Monoids
pp. 764
Navigating with a Browser
pp. 776
Improved Results for Stackelberg Scheduling Strategies
pp. 788
Call Control in Rings
pp. 800
Preemptive Scheduling in Overloaded Systems
pp. 812
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
pp. 821
Deciding DPDA Equivalence Is Primitive Recursive
pp. 833
Two-Way Alternating Automata and Finite Models
pp. 845
Approximating Huffman Codes in Parallel
pp. 856
Seamless Integration of Parallelism and Memory Hierarchy
pp. 868
The Communication Complexity of Approximate Set Packing and Covering
pp. 876
Antirandomizing the Wrong Game
pp. 888
Fast Universalization of Investment Strategies with Provably Good Relative Returns
pp. 901
Randomized Pursuit-Evasion in Graphs
pp. 913
The Essence of Principal Typings
pp. 926
Complete and Tractable Local Linear Time Temporal Logics over Traces
pp. 938
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
pp. 950
Random Numbers and an Incomplete Immune Recursive Set
pp. 962
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers
pp. 973
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
pp. 985
Finding a Path of Superlogarithmic Length
pp. 993
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
pp. 1005
Improved Inapproximability Results for Vertex Cover on k-Uniform Hypergraphs
pp. 1017
Efficient Testing of Hypergraphs
pp. 1029
Optimal Net Surface Problems with Applications
pp. 1043
Wagner’s Theorem on Realizers
pp. 1054
Circular Arrangements
Similar content
2,730
Using Artificial Intelligence and Novel Polynomials to Predict Subjective Refraction
Authors:
Radhika Rampat
,
Guillaume Debellemanière
,
Jacques Malet
…
The double round-robin population unravels the genetic architecture of grain size in barley
Authors:
Asis Shrestha
,
Francesco Cosenza
,
Delphine van Inghelandt
…
Log Diameter Rounds MST Verification and Sensitivity in MPC
Authors:
Sam Coy
,
Artur Czumaj
,
Gopinath Mishra
…
See all similar
Cited by
15
Founding Cryptography on Oblivious Transfer – Efficiently
Authors:
Yuval Ishai
,
Manoj Prabhakaran
,
Amit Sahai
Evaluating Branching Programs on Encrypted Data
Authors:
Yuval Ishai
,
Anat Paskin
Founding Cryptography on Tamper-Proof Hardware Tokens
Authors:
Vipul Goyal
,
Yuval Ishai
,
Amit Sahai
…
See all cited by