Sciweavers

151 search results - page 1 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
DCC
2006
IEEE
14 years 5 months ago
Optimal (2, n) visual cryptographic schemes
Mausumi Bose, Rahul Mukerjee
DCC
2005
IEEE
14 years 5 months ago
XOR-based Visual Cryptography Schemes
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically,...
Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, ...
ASIACRYPT
2005
Springer
13 years 11 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
CRYPTO
2004
Springer
123views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
Asymptotically Optimal Communication for Torus-Based Cryptography
Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the o...
Marten van Dijk, David P. Woodruff
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
13 years 10 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