Sciweavers

154 search results - page 5 / 31
» Proving Group Protocols Secure Against Eavesdroppers
Sort
View
ASIACRYPT
1999
Springer
15 years 2 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
EUROCRYPT
2000
Springer
15 years 1 months ago
Authenticated Key Exchange Secure against Dictionary Attacks
Password-based protocols for authenticated key exchange (AKE) are designed to work despite the use of passwords drawn from a space so small that an adversary might well enumerate, ...
Mihir Bellare, David Pointcheval, Phillip Rogaway
JCM
2007
191views more  JCM 2007»
14 years 9 months ago
Using Antenna Array Redundancy and Channel Diversity for Secure Wireless Transmissions
— The use of signal processing techniques to protect wireless transmissions is proposed as a way to secure wireless networks at the physical layer. This approach addresses a uniq...
Xiaohua Li, Juite Hwu, E. Paul Ratazzi
IJSN
2008
145views more  IJSN 2008»
14 years 9 months ago
Clique-based group key assignment in Wireless Sensor Networks
: Security has become the corner stone of research in wireless sensor networks (WSNs). Due to the unique operational environment of WSNs, where the communication medium is open to ...
Avinash Srinivasan, Feng Li, Jie Wu, Minglu Li
IACR
2011
107views more  IACR 2011»
13 years 9 months ago
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
Jan Camenisch, Kristiyan Haralambiev, Markulf Kohl...