FSTTCS 2010 - PDF Preprint Papers

FSTTCS 2010 Foundations of Software Technology and Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FSTTCS-2010 Paper

click to vote

FSTTCS
2010
Springer

78views Software Engineering» more FSTTCS 2010»

Lower bounds for Quantum Oblivious Transfer

1 years 3 months ago

Download www.liafa.jussieu.fr

Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...

André Chailloux, Iordanis Kerenidis, Jamie ...

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.

Related Conferences

Id	Views	Title	Status
1	78	Lower bounds for Quantum Oblivious Transfer	claim
2	77	Expressiveness of streaming string transducers	claim
3	72	Computationally Sound Abstraction and Verification of Secure Multi-Party Computations	claim
4	71	Global Escape in Multiparty Sessions	claim
5	71	On extracting computations from propositional proofs (a survey)	claim
6	71	Colored Hypergraph Isomorphism is Fixed Parameter Tractable	claim
7	67	Finding Sparser Directed Spanners	claim
8	67	Global Model Checking of Ordered Multi-Pushdown Systems	claim
9	64	Quasi-Random PCP and Hardness of 2-Catalog Segmentation	claim
10	62	The effect of girth on the kernelization complexity of Connected Dominating Set	claim
11	62	The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems	claim
12	61	Fast equivalence-checking for normed context-free processes	claim
13	61	Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete	claim
14	60	Reasoning About Strategies	claim
15	60	Place-Boundedness for Vector Addition Systems with one zero-test	claim
16	59	Generalized Mean-payoff and Energy Games	claim
17	59	Finding Independent Sets in Unions of Perfect Graphs	claim
18	58	Generalizing the powerset construction, coalgebraically	claim
19	57	Model Checking Concurrent Programs with Nondeterminism and Randomization	claim
20	57	Determining the Winner of a Dodgson Election is Hard	claim
21	57	ATL with Strategy Contexts: Expressiveness and Model Checking	claim
22	55	Model checking time-constrained scenario-based specifications	claim
23	55	Combinatorial Problems with Discounted Price Functions in Multi-agent Systems	claim
24	54	Parityizing Rabin and Streett	claim
25	54	Recent Progress and Open Problems in Algorithmic Convex Geometry	claim
26	53	Average Analysis of Glushkov Automata under a BST-Like Model	claim
27	51	One-Counter Stochastic Games	claim
28	49	Playing in stochastic environment: from multi-armed bandits to two-player games	claim
29	49	Computing Rational Radical Sums in Uniform TC^0	claim
30	49	A graph polynomial for independent sets of bipartite graphs	claim
31	48	Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems	claim
32	47	First-Order Logic with Reachability Predicates on Infinite Systems	claim
33	47	Two Size Measures for Timed Languages	claim
34	46	Minimizing Busy Time in Multiple Machine Real-time Scheduling	claim
35	40	Satisfiability of Acyclic and Almost Acyclic CNF Formulas	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers