Sciweavers

915 search results - page 54 / 183
» Proof labeling schemes
Sort
View
EUROCRYPT
2010
Springer
14 years 22 days ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
CN
2006
85views more  CN 2006»
13 years 8 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
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
EUROCRYPT
2005
Springer
14 years 1 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
ACL
2001
13 years 9 months ago
From Chunks to function-Argument Structure: A Similarity-Based Approach
Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partia...
Sandra Kübler, Erhard W. Hinrichs