CRYPTO 2001 - PDF Preprint Papers

CRYPTO 2001 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2001 Paper

click to vote

CRYPTO
2001
Springer

202views Cryptology» more CRYPTO 2001»

Revocation and Tracing Schemes for Stateless Receivers

13 years 8 months ago

Download www.wisdom.weizmann.ac.il

We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...

Dalit Naor, Moni Naor, Jeffery Lotspiech

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	202	Revocation and Tracing Schemes for Stateless Receivers	claim
2	162	New Public Key Cryptosystem Using Finite Non Abelian Groups	claim
3	155	RSA-OAEP Is Secure under the RSA Assumption	claim
4	153	Universally Composable Commitments	claim
5	152	Secure Distributed Linear Algebra in a Constant Number of Rounds	claim
6	147	Correlation Analysis of the Shrinking Generator	claim
7	145	Pseudorandomness from Braid Groups	claim
8	144	Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation	claim
9	139	Soundness in the Public-Key Model	claim
10	136	Session-Key Generation Using Human Passwords Only	claim
11	134	Identity-Based Encryption from the Weil Pairing	claim
12	134	A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0	claim
13	125	Robust Non-interactive Zero Knowledge	claim
14	119	Cryptanalysis of RSA Signatures with Fixed-Pattern Padding	claim
15	117	Online Ciphers and the Hash-CBC Construction	claim
16	116	Nonlinear Vector Resilient Functions	claim
17	113	OAEP Reconsidered	claim
18	111	On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase	claim
19	106	Oblivious Transfer in the Bounded Storage Model	claim
20	106	Forward-Secure Signatures with Optimal Signing and Verifying	claim
21	97	Minimal Complete Primitives for Secure Multi-party Computation	claim
22	97	Two-Party Generation of DSA Signatures	claim
23	95	Robustness for Free in Unconditional Multi-party Computation	claim
24	76	On the (Im)possibility of Obfuscating Programs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers