Sciweavers

977 search results - page 28 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
CCS
2004
ACM
14 years 1 months ago
Lessons learned using alloy to formally specify MLS-PCA trusted security architecture
In order to solve future Multi Level Security (MLS) problems, we have developed a solution based on the DARPA Polymorphous Computing Architecture (PCA). MLS-PCA uses a novel distr...
Brant Hashii
CHI
2010
ACM
14 years 2 months ago
Usability and strength in click-based graphical passwords
Click-based graphical passwords have attractive usability properties, such as cueing and good memorability. However, image size and number of click-points in each password signifi...
Elizabeth Stobert
PODC
2010
ACM
13 years 8 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
JOC
2000
95views more  JOC 2000»
13 years 7 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
MICRO
2006
IEEE
114views Hardware» more  MICRO 2006»
14 years 1 months ago
Authentication Control Point and Its Implications For Secure Processor Design
Secure processor architecture enables tamper-proof protection on software that addresses many difficult security problems such as reverse-engineering prevention, trusted computing...
Weidong Shi, Hsien-Hsin S. Lee