EUROCRYPT 2010 - PDF Preprint Papers

EUROCRYPT 2010 Int. Workshop/Conference on Theory and Application of

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EUROCRYPT-2010 Paper

click to vote

EUROCRYPT
2010
Springer

299views Cryptology» more EUROCRYPT 2010»

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

12 years 8 months ago

Download eprint.iacr.org

In this paper, we present two fully secure functional encryption schemes. Our ﬁrst result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...

Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Ka...

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	299	Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption	claim
2	276	Fully Homomorphic Encryption over the Integers	claim
3	241	Lattice Enumeration Using Extreme Pruning	claim
4	240	Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks	claim
5	221	Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases	claim
6	210	Bonsai Trees, or How to Delegate a Lattice Basis	claim
7	206	Universal One-Way Hash Functions via Inaccessible Entropy	claim
8	196	Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions	claim
9	187	Bounded Key-Dependent Message Security	claim
10	185	Adaptive Trapdoor Functions and Chosen-Ciphertext Security	claim
11	179	Algebraic Cryptanalysis of McEliece Variants with Compact Keys	claim
12	178	Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups	claim
13	174	Public-Key Encryption in the Bounded-Retrieval Model	claim
14	168	Secure Message Transmission with Small Public Discussion	claim
15	163	On the Impossibility of Three-Move Blind Signature Schemes	claim
16	162	Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds	claim
17	157	Adaptively Secure Broadcast	claim
18	156	Computational Soundness, Co-induction, and Encryption Cycles	claim
19	153	Efficient Lattice (H)IBE in the Standard Model	claim
20	151	On Ideal Lattices and Learning with Errors over Rings	claim
21	150	Stam's Collision Resistance Conjecture	claim
22	150	Constructing Verifiable Random Functions with Large Input Spaces	claim
23	140	Cryptographic Agility and Its Relation to Circular Encryption	claim
24	136	New Generic Algorithms for Hard Knapsacks	claim
25	134	Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography	claim
26	130	Partial Fairness in Secure Two-Party Computation	claim
27	117	A Simple BGN-Type Cryptosystem from LWE	claim
28	113	Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR	claim
29	102	Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers