ASIACRYPT 2007 - PDF Preprint Papers

ASIACRYPT 2007 International Conference on Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ASIACRYPT-2007 Paper

click to vote

ASIACRYPT
2007
Springer

187views Cryptology» more ASIACRYPT 2007»

Fully Anonymous Group Signatures Without Random Oracles

13 years 10 months ago

Download www.brics.dk

We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...

Jens Groth

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	187	Fully Anonymous Group Signatures Without Random Oracles	claim
2	162	Blind Identity-Based Encryption and Simulatable Oblivious Transfer	claim
3	154	Bounded CCA2-Secure Encryption	claim
4	149	Multi-party Indirect Indexing and Applications	claim
5	140	Miniature CCA2 PK Encryption: Tight Security Without Redundancy	claim
6	137	Faster Addition and Doubling on Elliptic Curves	claim
7	134	How to Build a Hash Function from Any Collision-Resistant Function	claim
8	128	Symmetric Key Cryptography on Modern Graphics Hardware	claim
9	126	Cryptanalysis of Grindahl	claim
10	126	Two-Party Computing with Encrypted Data	claim
11	125	Secure Protocols with Asymmetric Trust	claim
12	120	On Privacy Models for RFID	claim
13	119	On Efficient Message Authentication Via Block Cipher Design Techniques	claim
14	119	Simple and Efficient Perfectly-Secure Asynchronous MPC	claim
15	110	Group Encryption	claim
16	107	Relations Among Notions of Non-malleability for Encryption	claim
17	105	A Non-interactive Shuffle with Pairing Based Verifiability	claim
18	105	On Tweaking Luby-Rackoff Blockciphers	claim
19	104	When e-th Roots Become Easier Than Factoring	claim
20	103	Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions	claim
21	100	A Kilobit Special Number Field Sieve Factorization	claim
22	99	Seven-Property-Preserving Iterated Hashing: ROX	claim
23	89	Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions	claim
24	88	Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations	claim
25	80	A Key Recovery Attack on Edon80	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers