CRYPTO 2007 - PDF Preprint Papers

CRYPTO 2007 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2007 Paper

click to vote

CRYPTO
2007
Springer

172views Cryptology» more CRYPTO 2007»

Deterministic and Efficiently Searchable Encryption

14 years 3 months ago

Download eprint.iacr.org

We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...

Mihir Bellare, Alexandra Boldyreva, Adam O'Neill

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	172	Deterministic and Efficiently Searchable Encryption	claim
2	162	Universally-Composable Two-Party Computation in Two Rounds	claim
3	154	A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073	claim
4	149	Hash Functions and the (Amplified) Boomerang Attack	claim
5	145	Chernoff-Type Direct Product Theorems	claim
6	145	Secure Identification and QKD in the Bounded-Quantum-Storage Model	claim
7	144	Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach	claim
8	143	A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU	claim
9	134	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	claim
10	133	Amplifying Collision Resistance: A Complexity-Theoretic Treatment	claim
11	133	On Secure Multi-party Computation in Black-Box Groups	claim
12	132	Secure Hybrid Encryption from Weakened Key Encapsulation	claim
13	132	How Should We Solve Search Problems Privately?	claim
14	130	Reducing Trust in the PKG in Identity Based Cryptosystems	claim
15	130	A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator	claim
16	129	Rerandomizable RCCA Encryption	claim
17	123	Cryptography with Constant Input Locality	claim
18	116	Random Oracles and Auxiliary Input	claim
19	110	Cryptography in the Multi-string Model	claim
20	109	A Tight High-Order Entropic Quantum Uncertainty Relation with Applications	claim
21	106	Information Security Economics - and Beyond	claim
22	106	Simulatable VRFs with Applications to Multi-theorem NIZK	claim
23	106	Indistinguishability Amplification	claim
24	105	A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness	claim
25	104	Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5	claim
26	102	Improved Analysis of Kannan's Shortest Lattice Vector Algorithm	claim
27	99	Practical Cryptanalysis of SFLASH	claim
28	95	Security-Amplifying Combiners for Collision-Resistant Hash Functions	claim
29	93	How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?	claim
30	88	Invertible Universal Hashing and the TET Encryption Mode	claim
31	86	Public Key Encryption That Allows PIR Queries	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers