Sciweavers

977 search results - page 35 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
SDMW
2010
Springer
13 years 5 months ago
Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little ...
Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, P...
INFOCOM
2012
IEEE
12 years 6 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
13 years 11 months ago
Efficient Implementation of the Orlandi Protocol
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Niel...
WS
2004
ACM
14 years 1 months ago
Security considerations for IEEE 802.15.4 networks
The IEEE 802.15.4 specification outlines a new class of wireless radios and protocols targeted at low power devices, personal area networks, and sensor nodes. The specification ...
Naveen Sastry, David Wagner
ENTCS
2008
87views more  ENTCS 2008»
13 years 7 months ago
Remote Attestation on Legacy Operating Systems With Trusted Platform Modules
A lot of progress has been made to secure network communication, e.g., through the use of cryptographic algorithms. However, this offers only a partial solution as long as the com...
Dries Schellekens, Brecht Wyseur, Bart Preneel