Sciweavers

977 search results - page 52 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
ASIACRYPT
2000
Springer
14 years 4 days ago
Provably Secure Metering Scheme
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...
Wakaha Ogata, Kaoru Kurosawa
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
INFOCOM
1996
IEEE
13 years 12 months ago
Network Security via Reverse Engineering of TCP Code: Vulnerability Analysis and Proposed Solutions
The Transmission Control Protocol Internet Protocol TCP IP 1 suite is a very widely used technique that is employed to interconnect computing facilities in modern network environm...
Biswaroop Guha, Biswanath Mukherjee
INFORMATICALT
2010
132views more  INFORMATICALT 2010»
13 years 5 months ago
An Improved Securer and Efficient Nonce-Based Authentication Scheme with Token-Update
In this paper, we propose a mutual authentication scheme using nonce variable instead of Mac address and accompanying with token updates to improve the functionality. Lee et al. (2...
Chiu-Hsiung Liao, Ching-Te Wang, Hon-Chan Chen
GD
2008
Springer
13 years 9 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...