TCC 2007 - PDF Preprint Papers

TCC 2007 Theory of Cryptography Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCC-2007 Paper

click to vote

TCC
2007
Springer

170views Cryptology» more TCC 2007»

Secure Linear Algebra Using Linearly Recurrent Sequences

14 years 6 months ago

Download homepages.cwi.nl

In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...

Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...

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	170	Secure Linear Algebra Using Linearly Recurrent Sequences	claim
2	146	Conjunctive, Subset, and Range Queries on Encrypted Data	claim
3	145	(Password) Authenticated Key Establishment: From 2-Party to Group	claim
4	142	On Best-Possible Obfuscation	claim
5	125	Evaluating Branching Programs on Encrypted Data	claim
6	125	Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions	claim
7	125	From Weak to Strong Watermarking	claim
8	124	Tackling Adaptive Corruptions in Multicast Encryption Protocols	claim
9	116	Long-Term Security and Universal Composability	claim
10	114	Multi-authority Attribute Based Encryption	claim
11	112	On the Necessity of Rewinding in Secure Multiparty Computation	claim
12	110	Robuster Combiners for Oblivious Transfer	claim
13	104	Unifying Classical and Quantum Key Distillation	claim
14	104	Obfuscation for Cryptographic Purposes	claim
15	102	Perfect NIZK with Adaptive Soundness	claim
16	102	Universally Composable Security with Global Setup	claim
17	102	Parallel Repetition of Computationally Sound Protocols Revisited	claim
18	100	Private Approximation of Clustering and Vertex Cover	claim
19	96	Securely Obfuscating Re-encryption	claim
20	94	Does Privacy Require True Randomness?	claim
21	93	Intrusion-Resilient Key Exchange in the Bounded Retrieval Model	claim
22	92	One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments	claim
23	91	Lower Bounds for Non-interactive Zero-Knowledge	claim
24	89	On Secret Sharing Schemes, Matroids and Polymatroids	claim
25	86	Weakly-Private Secret Sharing Schemes	claim
26	76	Designated Confirmer Signatures Revisited	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers