Sciweavers

4795 search results - page 430 / 959
» The Message Classification Model
Sort
View
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
16 years 1 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong
INFOCOM
2007
IEEE
16 years 1 months ago
Scalable Secure Bidirectional Group Communication
— Many network applications are based on a group communications model where one party sends messages to a large number of authorized recipients and/or receives messages from mult...
Yitao Duan, John F. Canny
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
ESORICS
2007
Springer
16 years 1 months ago
SilentKnock: Practical, Provably Undetectable Authentication
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
Eugene Y. Vasserman, Nicholas Hopper, John Laxson,...
FROCOS
2007
Springer
16 years 1 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...