Sciweavers

555 search results - page 99 / 111
» From ABZ to Cryptography
Sort
View
IACR
2011
127views more  IACR 2011»
12 years 9 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
CODASPY
2012
12 years 5 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
12 years 7 days ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
SPW
2000
Springer
14 years 1 months ago
The Resurrecting Duckling - What Next?
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
Frank Stajano
IEEESP
2006
130views more  IEEESP 2006»
13 years 9 months ago
Securing Embedded Systems
t a single security abstraction layer, but rather is a roblem spanning multiple abstraction levels. We use an embedded biometric authentication device to demonstratethenecessityofa...
David Hwang, Patrick Schaumont, Kris Tiri, Ingrid ...