CRYPTO 2006 - PDF Preprint Papers

CRYPTO 2006 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2006 Paper

click to vote

CRYPTO
2006
Springer

232views Cryptology» more CRYPTO 2006»

Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields

14 years 4 months ago

Download www.iacr.org

Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...

Hao Chen, Ronald Cramer

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	232	Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields	claim
2	224	Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)	claim
3	159	Asymptotically Optimal Two-Round Perfectly Secure Message Transmission	claim
4	155	A Method for Making Password-Based Key Exchange Resilient to Server Compromise	claim
5	149	On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation	claim
6	140	Lattice-Based Cryptography	claim
7	134	Round-Optimal Composable Blind Signatures in the Common Reference String Model	claim
8	129	New Proofs for	claim
9	125	Automated Security Proofs with Sequences of Games	claim
10	125	On the Higher Order Nonlinearities of Algebraic Immune Functions	claim
11	124	Mitigating Dictionary Attacks on Password-Protected Local Storage	claim
12	119	Rankin's Constant and Blockwise Lattice Reduction	claim
13	117	On Forward-Secure Storage	claim
14	115	The Number Field Sieve in the Medium Prime Case	claim
15	112	On Signatures of Knowledge	claim
16	112	On Expected Constant-Round Protocols for Byzantine Agreement	claim
17	112	Receipt-Free Universally-Verifiable Voting with Everlasting Privacy	claim
18	111	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models	claim
19	110	On the Power of the Randomized Iterate	claim
20	109	Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One	claim
21	108	Inverting HFE Is Quasipolynomial	claim
22	107	Cryptanalysis of 2R- Schemes	claim
23	106	On Robust Combiners for Private Information Retrieval and Other Primitives	claim
24	104	Random Selection with an Adversarial Majority	claim
25	101	When Random Sampling Preserves Privacy	claim
26	99	Scalable Secure Multiparty Computation	claim
27	97	Robust Multiparty Computation with Linear Communication Complexity	claim
28	93	Rationality and Adversarial Behavior in Multi-party Computation	claim
29	92	Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs	claim
30	89	Oblivious Transfer and Linear Functions	claim
31	89	Non-interactive Zaps and New Techniques for NIZK	claim
32	88	On the Impossibility of Efficiently Combining Collision Resistant Hash Functions	claim
33	84	Strengthening Digital Signatures Via Randomized Hashing	claim
34	82	Fast Algorithms for the Free Riders Problem in Broadcast Encryption	claim
35	73	Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers