TCC 2005 - PDF Preprint Papers

TCC 2005 Theory of Cryptography Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCC-2005 Paper

click to vote

TCC
2005
Springer

176views Cryptology» more TCC 2005»

How to Securely Outsource Cryptographic Computations

14 years 5 months ago

Download www.cs.jhu.edu

We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security deﬁnition for securely outsourcing computations from a comp...

Susan Hohenberger, Anna Lysyanskaya

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	176	How to Securely Outsource Cryptographic Computations	claim
2	169	Chosen-Ciphertext Security of Multiple Encryption	claim
3	166	Adaptively-Secure, Non-interactive Public-Key Encryption	claim
4	163	Adaptive Security of Symbolic Encryption	claim
5	141	Public-Key Steganography with Active Attacks	claim
6	141	Characterizing Ideal Weighted Threshold Secret Sharing	claim
7	139	The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives	claim
8	132	Evaluating 2-DNF Formulas on Ciphertexts	claim
9	118	On the Relationships Between Notions of Simulation-Based Security	claim
10	116	Error Correction in the Bounded Storage Model	claim
11	115	The Universal Composable Security of Quantum Key Distribution	claim
12	113	Entropic Security and the Encryption of High Entropy Messages	claim
13	108	Comparing Two Notions of Simulatability	claim
14	103	Fair-Zero Knowledge	claim
15	102	Toward Privacy in Public Databases	claim
16	102	Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs	claim
17	101	Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs	claim
18	96	Secure Computation of the Mean and Related Statistics	claim
19	95	Keyword Search and Oblivious Pseudorandom Functions	claim
20	94	Optimal Error Correction Against Computationally Bounded Noise	claim
21	90	A Universally Composable Secure Channel Based on the KEM-DEM Framework	claim
22	88	Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation	claim
23	77	Upper and Lower Bounds on Black-Box Steganography	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers