Sciweavers

SDMW
2010
Springer
13 years 9 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...
SAFECOMP
2010
Springer
13 years 9 months ago
Experiences in Applying Formal Verification in Robotics
Formal verification efforts in the area of robotics are still comparatively scarce. In this paper we report on our experiences with one such effort, which was concerned with design...
Dennis Walter, Holger Täubig, Christoph L&uum...
RFIDSEC
2010
13 years 9 months ago
Tree-Based RFID Authentication Protocols Are Definitively Not Privacy-Friendly
Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensu...
Gildas Avoine, Benjamin Martin 0002, Tania Martin
PROVSEC
2010
Springer
13 years 9 months ago
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
Laila El Aimani
PROVSEC
2010
Springer
13 years 9 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
PROVSEC
2010
Springer
13 years 9 months ago
Distinguishing Distributions Using Chernoff Information
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
Thomas Baignères, Pouyan Sepehrdad, Serge V...
PROVSEC
2010
Springer
13 years 9 months ago
Improved Zero-Knowledge Identification with Lattices
Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be u...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
PAISI
2010
Springer
13 years 9 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
OOPSLA
2010
Springer
13 years 9 months ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel
OOPSLA
2010
Springer
13 years 9 months ago
Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
Stefan Marr