CRYPTO 2008 - PDF Preprint Papers

CRYPTO 2008 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2008 Paper

click to vote

CRYPTO
2008
Springer

186views Cryptology» more CRYPTO 2008»

Communication Complexity in Algebraic Two-Party Protocols

13 years 6 months ago

Download cs.ucla.edu

In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...

Rafail Ostrovsky, William E. Skeith III

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	186	Communication Complexity in Algebraic Two-Party Protocols	claim
2	165	Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries	claim
3	163	Cryptanalysis of the GOST Hash Function	claim
4	150	On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles	claim
5	134	Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems	claim
6	132	Public-Key Locally-Decodable Codes	claim
7	123	Collusion-Free Protocols in the Mediated Model	claim
8	120	The Random Oracle Model and the Ideal Cipher Model Are Equivalent	claim
9	109	Adaptive One-Way Functions and Applications	claim
10	107	Circular-Secure Encryption from Decision Diffie-Hellman	claim
11	100	A Framework for Efficient and Composable Oblivious Transfer	claim
12	100	Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms	claim
13	98	One-Time Programs	claim
14	95	Preimages for Reduced SHA-0 and SHA-1	claim
15	95	Programmable Hash Functions and Their Applications	claim
16	93	Distributed Private Data Analysis: Simultaneously Solving How and What	claim
17	92	Compression from Collisions, or Why CRHF Combiners Have a Long Output	claim
18	85	Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs	claim
19	85	Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations	claim
20	84	Improved Bounds on Security Reductions for Discrete Log Based Signatures	claim
21	83	Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles	claim
22	80	Dynamic Threshold Public-Key Encryption	claim
23	76	Scalable Multiparty Computation with Nearly Optimal Work and Resilience	claim
24	75	New Efficient Attacks on Statistical Disclosure Control Mechanisms	claim
25	70	Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers