Sciweavers

176 search results - page 15 / 36
» Distinguishing Attacks on T-Functions
Sort
View
CRYPTO
2010
Springer
189views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
Eike Kiltz, Adam O'Neill, Adam Smith
SOUPS
2009
ACM
14 years 2 months ago
Machine learning attacks against the Asirra CAPTCHA
The ASIRRA CAPTCHA [6], recently proposed at ACM CCS 2007, relies on the problem of distinguishing images of cats and dogs (a task that humans are very good at). The security of AS...
Philippe Golle
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 7 months ago
On the Security of Huang-Chang Multi-signature Schemes
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...
Jianhong Zhang, Wei Zou
CN
2011
116views more  CN 2011»
13 years 2 months ago
WDA: A Web farm Distributed Denial Of Service attack attenuator
Distributed Denial Of Service (DDoS) attacks are familiar threats to Internet users for more than ten years. Such attacks are carried out by a “Bot net”, an army of zombie hos...
Ehud Doron, Avishai Wool
IACR
2011
134views more  IACR 2011»
12 years 7 months ago
An Exploration of the Kolmogorov-Smirnov Test as Competitor to Mutual Information Analysis
A theme of recent side-channel research has been the quest for distinguishers which remain eective even when few assumptions can be made about the underlying distribution of the m...
Carolyn Whitnall, Elisabeth Oswald, Luke Mather