Sciweavers

248 search results - page 35 / 50
» Authentication Primitives and Their Compilation
Sort
View
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
15 years 10 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
CSFW
2009
IEEE
15 years 4 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
PROVSEC
2009
Springer
15 years 4 months ago
Breaking and Fixing of an Identity Based Multi-Signcryption Scheme
Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
CSFW
2008
IEEE
15 years 4 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi
ICMCS
2008
IEEE
174views Multimedia» more  ICMCS 2008»
15 years 4 months ago
The Vera am Mittag German audio-visual emotional speech database
The lack of publicly available annotated databases is one of the major barriers to research advances on emotional information processing. In this contribution we present a recentl...
Michael Grimm, Kristian Kroschel, Shrikanth Naraya...