Sciweavers

95 search results - page 14 / 19
» Bounded CCA2-Secure Encryption
Sort
View
ASIACRYPT
2009
Springer
14 years 1 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
CEC
2008
IEEE
14 years 1 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 7 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
CISS
2008
IEEE
14 years 1 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He
FC
2010
Springer
135views Cryptology» more  FC 2010»
13 years 10 months ago
Multichannel Protocols to Prevent Relay Attacks
A number of security systems, from Chip-and-PIN payment cards to contactless subway and train tokens, as well as secure localization systems, are vulnerable to relay attacks. Encry...
Frank Stajano, Ford-Long Wong, Bruce Christianson