Sciweavers

840 search results - page 152 / 168
» Open multi-methods for c
Sort
View
ASIACRYPT
2004
Springer
15 years 5 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
CCS
2004
ACM
15 years 5 months ago
Web tap: detecting covert web traffic
As network security is a growing concern, system administrators lock down their networks by closing inbound ports and only allowing outbound communication over selected protocols ...
Kevin Borders, Atul Prakash
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 5 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
SEMWEB
2004
Springer
15 years 5 months ago
Structure-Based Partitioning of Large Concept Hierarchies
Abstract. The increasing awareness of the benefits of ontologies for information processing has lead to the creation of a number of large ontologies about real world domains. The ...
Heiner Stuckenschmidt, Michel C. A. Klein
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
15 years 5 months ago
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...