Sciweavers

5665 search results - page 180 / 1133
» Introduction to Computer Security
Sort
View
FOCS
2010
IEEE
15 years 11 days ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
JOC
2000
95views more  JOC 2000»
15 years 2 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
SOSP
2003
ACM
15 years 11 months ago
Terra: a virtual machine-based platform for trusted computing
We present a flexible architecture for trusted computing, called Terra, that allows applications with a wide range of security requirements to run simultaneously on commodity har...
Tal Garfinkel, Ben Pfaff, Jim Chow, Mendel Rosenbl...
113
Voted
CCS
2001
ACM
15 years 6 months ago
The performance of public key-enabled kerberos authentication in mobile computing applications
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
Alan Harbitter, Daniel A. Menascé
ISSTA
2010
ACM
15 years 6 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder