CRYPTO 2004 - PDF Preprint Papers

CRYPTO 2004 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2004 Paper

click to vote

CRYPTO
2004
Springer

205views Cryptology» more CRYPTO 2004»

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model

13 years 9 months ago

Download www.dia.unisa.it

In the bare public-key model (BPK in short), each veriﬁer is assumed to have deposited a public key in a ﬁle that is accessible by all users at all times. In this model, intro...

Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...

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	205	Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model	claim
2	162	Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography	claim
3	154	An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators	claim
4	145	Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring	claim
5	139	How to Compress Rabin Ciphertexts and Signatures (and More)	claim
6	138	Secure Identity Based Encryption Without Random Oracles	claim
7	130	Signature Schemes and Anonymous Credentials from Bilinear Maps	claim
8	128	Faster Correlation Attack on Bluetooth Keystream Generator E0	claim
9	127	IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange	claim
10	126	Compressed Pairings	claim
11	123	Asymptotically Optimal Communication for Torus-Based Cryptography	claim
12	121	A New Paradigm of Hybrid Encryption Scheme	claim
13	120	Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness	claim
14	120	Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers	claim
15	120	Round-Optimal Secure Two-Party Computation	claim
16	119	Security of Random Feistel Schemes with 5 or More Rounds	claim
17	118	Short Group Signatures	claim
18	115	Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes	claim
19	112	Feistel Schemes and Bi-linear Cryptanalysis	claim
20	111	Signed Binary Representations Revisited	claim
21	109	On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields	claim
22	108	Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?	claim
23	102	Complete Classification of Bilinear Hard-Core Functions	claim
24	97	Efficient Tree-Based Revocation in Groups of Low-State Devices	claim
25	92	The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols	claim
26	91	Privacy-Preserving Datamining on Vertically Partitioned Databases	claim
27	91	Non-interactive Timestamping in the Bounded Storage Model	claim
28	87	Security, Liberty, and Electronic Communications	claim
29	86	On Multiple Linear Approximations	claim
30	79	Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions	claim
31	77	Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers