Sciweavers

270 search results - page 19 / 54
» Verifying Second-Level Security Protocols
Sort
View
EUROCRYPT
2007
Springer
14 years 14 days ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
CCS
2007
ACM
14 years 2 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
ASIACRYPT
2010
Springer
13 years 6 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
CSREASAM
2006
13 years 10 months ago
Efficient and Secure Authentication Protocols for Mobile VoIP Communications
Mobile Voice over IP (Mobile VoIP) allows mobile users to continuously talk with each others while roaming across different networks. In such wireless application, it is vulnerabl...
Huang-Ju Chen, Jyh-Ming Huang, Lei Wang
ICDCS
2007
IEEE
14 years 2 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee