EUROCRYPT 2008 - PDF Preprint Papers

EUROCRYPT 2008 Int. Workshop/Conference on Theory and Application of

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EUROCRYPT-2008 Paper

click to vote

EUROCRYPT
2008
Springer

164views Cryptology» more EUROCRYPT 2008»

Efficient Two Party and Multi Party Computation Against Covert Adversaries

13 years 6 months ago

Download pages.cpsc.ucalgary.ca

Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...

Vipul Goyal, Payman Mohassel, Adam Smith

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	164	Efficient Two Party and Multi Party Computation Against Covert Adversaries	claim
2	162	Collisions for the LPS Expander Graph Hash Function	claim
3	157	Almost-Everywhere Secure Computation	claim
4	129	Isolated Proofs of Knowledge and Isolated Zero Knowledge	claim
5	126	The Twin Diffie-Hellman Problem and Applications	claim
6	124	Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors	claim
7	120	On the Indifferentiability of the Sponge Construction	claim
8	118	A Practical Attack on KeeLoq	claim
9	107	Towards Key-Dependent Message Security in the Standard Model	claim
10	106	Efficient Non-interactive Proof Systems for Bilinear Groups	claim
11	105	Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products	claim
12	102	New Constructions for UC Secure Computation Using Tamper-Proof Hardware	claim
13	101	A New Mode of Operation for Block Ciphers and Length-Preserving MACs	claim
14	95	Security/Efficiency Tradeoffs for Permutation-Based Hashing	claim
15	91	Zero-Knowledge Sets with Short Proofs	claim
16	91	David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware	claim
17	90	Key Recovery on Hidden Monomial Multivariate Schemes	claim
18	87	New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5	claim
19	85	Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme	claim
20	82	Efficient Sequential Aggregate Signed Data	claim
21	80	Second Preimage Attacks on Dithered Hash Functions	claim
22	79	Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle	claim
23	79	Proving Tight Security for Rabin-Williams Signatures	claim
24	78	Predicting Lattice Reduction	claim
25	76	Obfuscating Point Functions with Multibit Output	claim
26	73	Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves	claim
27	69	Precise Concurrent Zero Knowledge	claim
28	69	Threshold RSA for Dynamic and Ad-Hoc Groups	claim
29	64	Protocols and Lower Bounds for Failure Localization in the Internet	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers