Sciweavers

1825 search results - page 231 / 365
» Cryptographic Securities Exchanges
Sort
View
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
14 years 3 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
IACR
2011
127views more  IACR 2011»
14 years 3 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
271
Voted
POPL
2001
ACM
16 years 4 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
139
Voted
ACNS
2009
Springer
123views Cryptology» more  ACNS 2009»
15 years 10 months ago
Practical Secure Evaluation of Semi-private Functions
Abstract. Two-party Secure Function Evaluation (SFE) is a very useful cryptographic tool which allows two parties to evaluate a function known to both parties on their private (sec...
Annika Paus, Ahmad-Reza Sadeghi, Thomas Schneider
134
Voted
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
15 years 10 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks