TCC 2010 - PDF Preprint Papers

TCC 2010 Theory of Cryptography Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCC-2010 Paper

click to vote

TCC
2010
Springer

381views Cryptology» more TCC 2010»

New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts

14 years 9 months ago

Download eprint.iacr.org

We construct a fully secure HIBE scheme with short ciphertexts. The previous construction of Boneh, Boyen, and Goh was only proven to be secure in the selective model, under a non...

Allison B. Lewko, Brent Waters

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	381	New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts	claim
2	324	Leakage-Resilient Signatures	claim
3	303	Efficient Rational Secret Sharing in Standard Communication Networks	claim
4	236	From Passive to Covert Security at Low Cost	claim
5	231	A Domain Extender for the Ideal Cipher	claim
6	208	Rationality in the Full-Information Model	claim
7	188	Almost Optimal Bounds for Direct Product Threshold Theorem	claim
8	188	Founding Cryptography on Tamper-Proof Hardware Tokens	claim
9	188	Delayed-Key Message Authentication for Streams	claim
10	179	Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs	claim
11	179	Private Coins versus Public Coins in Zero-Knowledge Proof Systems	claim
12	179	On Symmetric Encryption and Point Obfuscation	claim
13	178	Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems	claim
14	176	Ideal Hierarchical Secret Sharing Schemes	claim
15	175	Obfuscation of Hyperplane Membership	claim
16	173	Bounds on the Sample Complexity for Private Learning and Private Data Release	claim
17	170	Public-Key Cryptographic Primitives Provably as Secure as Subset Sum	claim
18	170	On Related-Secret Pseudorandomness	claim
19	169	On Complete Primitives for Fairness	claim
20	166	Public-Key Encryption Schemes with Auxiliary Inputs	claim
21	163	Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs	claim
22	141	Composition of Zero-Knowledge Proofs with Efficient Provers	claim
23	140	Robust Encryption	claim
24	133	On the Necessary and Sufficient Assumptions for UC Computation	claim
25	121	An Efficient Parallel Repetition Theorem	claim
26	119	Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model	claim
27	117	Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers