FOCS 1999 - PDF Preprint Papers

FOCS 1999 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-1999 Paper

click to vote

FOCS
1999
IEEE

180views Theoretical Computer Science» more FOCS 1999»

Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security

14 years 3 months ago

Download www.cs.ucla.edu

We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...

Amit Sahai

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	180	Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security	claim
2	165	An Algorithmic Theory of Learning: Robust Concepts and Random Projection	claim
3	156	Near-Optimal Conversion of Hardness into Pseudo-Randomness	claim
4	131	Boosting and Hard-Core Sets	claim
5	125	Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain	claim
6	120	The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals	claim
7	117	Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics	claim
8	114	Hardness of Approximating the Minimum Distance of a Linear Code	claim
9	113	An Approximate L1-Difference Algorithm for Massive Data Streams	claim
10	105	A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction	claim
11	103	On the Complexity of SAT	claim
12	103	A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems	claim
13	102	Learning Mixtures of Gaussians	claim
14	96	A Study of Proof Search Algorithms for Resolution and Polynomial Calculus	claim
15	95	Bounds for Small-Error and Zero-Error Quantum Algorithms	claim
16	95	Taking a Walk in a Planar Arrangement	claim
17	94	How Asymmetry Helps Load Balancing	claim
18	90	Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings	claim
19	90	Derandomizing Arthur-Merlin Games Using Hitting Sets	claim
20	89	Regular Languages Are Testable with a Constant Number of Queries	claim
21	86	PSPACE Has Constant-Round Quantum Interactive Proof Systems	claim
22	84	Efficient Testing of Large Graphs	claim
23	83	Limits on the Efficiency of One-Way Permutation-Based Hash Functions	claim
24	82	Fairness in Routing and Load Balancing	claim
25	82	Reducing Network Congestion and Blocking Probability Through Balanced Allocation	claim
26	80	A Sublinear Time Approximation Scheme for Clustering in Metric Spaces	claim
27	80	Optimal Lower Bounds for Quantum Automata and Random Access Codes	claim
28	74	A Non-linear Time Lower Bound for Boolean Branching Programs	claim
29	73	Magic Functions	claim
30	71	Primality and Identity Testing via Chinese Remaindering	claim
31	70	On Counting Independent Sets in Sparse Graphs	claim
32	68	Weak Adversaries for the k-Server Problem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers