New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-32009-5_26
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Non-Interactive Secure Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Completeness Theorem for Trigonometric Identities and Various Results on Exponential Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1986English

An Impossibility Theorem for Price-Adjustment Mechanisms

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2010English

Arrow's Impossibility Theorem

Formalized Mathematics
Computational MathematicsApplied Mathematics
2007English

Multi-Client Non-Interactive Verifiable Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Two Impossibility Results for Measures of Corroboration

British Journal for the Philosophy of Science
PhilosophyPhilosophy of ScienceHistory
2016English

RETRACTED ARTICLE: A Completeness Theorem for Continuous Predicate Modal Logic

Archive for Mathematical Logic
PhilosophyLogic
2017English

Adaptively-Secure, Non-Interactive Public-Key Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy