<--- Back to Details
First PageDocument Content
Cryptographic protocols / Mathematics / Secure multi-party computation / Linear algebra / Valuation / Linear combination / Finite field
Date: 2015-06-09 02:13:24
Cryptographic protocols
Mathematics
Secure multi-party computation
Linear algebra
Valuation
Linear combination
Finite field

Efficient Multi-Party Computation: from Passive to Active Security via Secure SIMD Circuits Daniel Genkin12 , Yuval Ishai1 , and Antigoni Polychroniadou3 1

Add to Reading List

Source URL: web.eecs.umich.edu

Download Document from Source Website

File Size: 493,49 KB

Share Document on Facebook

Similar Documents

On the Robustness of some Cryptographic Protocols for Mobile Agent Protection Volker Roth Fraunhofer Institut f¨ur Graphische Datenverarbeitung Rundeturmstraße 6, 64283 Darmstadt, Germany

On the Robustness of some Cryptographic Protocols for Mobile Agent Protection Volker Roth Fraunhofer Institut f¨ur Graphische Datenverarbeitung Rundeturmstraße 6, 64283 Darmstadt, Germany

DocID: 1uZJK - View Document

Verifying Cryptographic Protocols in Applied Pi Calculus Mark Ryan Ben Smyth

Verifying Cryptographic Protocols in Applied Pi Calculus Mark Ryan Ben Smyth

DocID: 1uXvn - View Document

Secure Cryptographic Protocols for E-commerce Transaction  on the Internet

Secure Cryptographic Protocols for E-commerce Transaction on the Internet

DocID: 1uDkO - View Document

Type-Based Automated Verification of Authenticity in Cryptographic Protocols Daisuke Kikuchi and Naoki Kobayashi Graduate School of Information Sciences, Tohoku University {kikuchi,koba}@kb.ecei.tohoku.ac.jp

Type-Based Automated Verification of Authenticity in Cryptographic Protocols Daisuke Kikuchi and Naoki Kobayashi Graduate School of Information Sciences, Tohoku University {kikuchi,koba}@kb.ecei.tohoku.ac.jp

DocID: 1u5Us - View Document

Cryptographic schemes  Protocols Specifications of primitives

Cryptographic schemes Protocols Specifications of primitives

DocID: 1u4P2 - View Document