Amanote Research

Amanote Research

  • Register
  • Sign In

Efficient Non-Interactive Secure Computation

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-20465-4_23

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2011

Authors

Yuval IshaiEyal KushilevitzRafail OstrovskyManoj PrabhakaranAmit Sahai

Publisher

Springer Berlin Heidelberg


Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Multi-Client Non-Interactive Verifiable Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Efficient Secure Two-Party Computation Against Malicious Adversaries

English

Adaptively-Secure, Non-Interactive Public-Key Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Secure Computation

English

Secure Computation Without Authentication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Efficient Non-Interactive Proof Systems for Bilinear Groups

English

Foundations of Secure Interactive Computing

English

Secure Computation Against Adaptive Auxiliary Information

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013French

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy