Sciweavers

977 search results - page 19 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
COMPSAC
2011
IEEE
12 years 7 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...
ACSAC
2006
IEEE
14 years 1 months ago
Engineering Sufficiently Secure Computing
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
Brian Witten

Lecture Notes
404views
15 years 5 months ago
Network Security
A comprehensive treatment of network security. Topics include remote access security, DMZ, firewalls, VPNs, PKI architecture, X.509 Public key infrastructure, web security, S-HTTP,...
Raj Jain
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz