Sciweavers

53 search results - page 7 / 11
» crypto 2000
Sort
View
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
We investigate the all-or-nothing encryption paradigm which was introduced by Rivest as a new mode of operation for block ciphers. The paradigm involves composing an all-or-nothing...
Anand Desai
DCC
2007
IEEE
14 years 9 months ago
Towards generating secure keys for braid cryptography
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...
Ki Hyoung Ko, Jang-Won Lee, Tony Thomas
EUROCRYPT
2003
Springer
14 years 3 months ago
Cryptanalysis of the Public-Key Encryption Based on Braid Groups
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By thi...
Eonkyung Lee, Je Hong Park