Sciweavers

90 search results - page 14 / 18
» Pairings for cryptographers
Sort
View
FC
2006
Springer
145views Cryptology» more  FC 2006»
15 years 1 months ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
JCST
2008
120views more  JCST 2008»
14 years 9 months ago
Generic Transformation from Weakly to Strongly Unforgeable Signatures
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
Qiong Huang, Duncan S. Wong, Jin Li, Yiming Zhao
DSN
2009
IEEE
15 years 1 months ago
HC-BGP: A light-weight and flexible scheme for securing prefix ownership
The Border Gateway Protocol (BGP) is a fundamental building block of the Internet infrastructure. However, due to the implicit trust assumption among networks, Internet routing re...
Ying Zhang, Zheng Zhang, Zhuoqing Morley Mao, Y. C...
80
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Secure wireless communications: Secret keys through multipath
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
Akbar M. Sayeed, Adrian Perrig
69
Voted
ALT
2000
Springer
15 years 1 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata