CRYPTO 2000 - PDF Preprint Papers

CRYPTO 2000 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2000 Paper

click to vote

CRYPTO
2000
Springer

277views Cryptology» more CRYPTO 2000»

Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications

14 years 4 months ago

Download www.iacr.org

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	277	Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications	claim
2	184	A Practical and Provably Secure Coalition-Resistant Group Signature Scheme	claim
3	182	A Note on the Round-Complexity of Concurrent Zero-Knowledge	claim
4	175	A Chosen-Ciphertext Attack against NTRU	claim
5	157	Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing	claim
6	151	New Public-Key Cryptosystem Using Braid Groups	claim
7	149	A Cryptographic Solution to a Game Theoretic Problem	claim
8	145	Nonlinearity Bounds and Constructions of Resilient Boolean Functions	claim
9	141	Improved Non-committing Encryption Schemes Based on a General Complexity Assumption	claim
10	141	New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack	claim
11	141	Differential Fault Attacks on Elliptic Curve Cryptosystems	claim
12	139	On the Exact Security of Full Domain Hash	claim
13	136	Long-Lived Broadcast Encryption	claim
14	134	Taming the Adversary	claim
15	133	Provably Secure Partially Blind Signatures	claim
16	133	Sequential Traitor Tracing	claim
17	129	Weaknesses in the SL2(IFs2) Hashing Scheme	claim
18	128	The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search	claim
19	128	The XTR Public Key System	claim
20	124	Fast Correlation Attacks through Reconstruction of Linear Polynomials	claim
21	123	Key Recovery and Forgery Attacks on the MacDES MAC Algorithm	claim
22	122	Efficient Non-malleable Commitment Schemes	claim
23	121	CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions	claim
24	120	L-collision Attacks against Randomized MACs	claim
25	110	Parallel Reducibility for Information-Theoretically Secure Computation	claim
26	108	Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers	claim
27	99	Timed Commitments	claim
28	91	An Improved Pseudo-random Generator Based on Discrete Log	claim
29	89	On the Round Security of Symmetric-Key Cryptographic Primitives	claim
30	81	Optimistic Fair Secure Computation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers