Sciweavers

977 search results - page 78 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
WWW
2002
ACM
14 years 9 months ago
Abstracting application-level web security
ing Application-Level Web Security David Scott Laboratory For Communications Engineering Engineering Department Trumpington Street Cambridge CB2 1PZ djs55@eng.cam.ac.uk Richard Sha...
David Scott, Richard Sharp
SOUPS
2006
ACM
14 years 3 months ago
Seeing further: extending visualization as a basis for usable security
The focus of our approach to the usability considerations of privacy and security has been on providing people with information they can use to understand the implications of thei...
Jennifer Ann Rode, Carolina Johansson, Paul DiGioi...
CCS
2010
ACM
13 years 10 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
ASIACRYPT
2007
Springer
14 years 3 months ago
Bounded CCA2-Secure Encryption
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, ...
EUROCRYPT
2007
Springer
14 years 3 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan