Sciweavers

977 search results - page 173 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
JEI
2002
152views more  JEI 2002»
13 years 9 months ago
Cryptanalysis of the Yeung - Mintzer fragile watermarking technique
The recent proliferation of digital multimedia content has raised concerns about authentication mechanisms for multimedia data. A number of authentication techniques based on digi...
Jessica J. Fridrich, Miroslav Goljan, Nasir Memon
NOMS
2010
IEEE
134views Communications» more  NOMS 2010»
13 years 8 months ago
Packet sampling for worm and botnet detection in TCP connections
—Malware and botnets pose a steady and growing threat to network security. Therefore, packet analysis systems examine network traffic to detect active botnets and spreading worm...
Lothar Braun, Gerhard Münz, Georg Carle
ASIACRYPT
2010
Springer
13 years 7 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
IJNSEC
2010
247views more  IJNSEC 2010»
13 years 4 months ago
Hardware Implementation of Efficient Modified Karatsuba Multiplier Used in Elliptic Curves
The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and imp...
Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail
INFOCOM
2011
IEEE
13 years 1 months ago
A highly scalable bandwidth estimation of commercial hotspot access points
—WiFi access points that provide Internet access to users have been steadily increasing in urban areas. Different access points differ from one another in terms of services that ...
Xinyu Xing, Jianxun Dang, Shivakant Mishra, Xue Li...