Sciweavers

266 search results - page 30 / 54
» General Homomorphic Overloading
Sort
View
122
Voted
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 2 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
85
Voted
ENTCS
2006
125views more  ENTCS 2006»
15 years 13 days ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
99
Voted
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 12 days ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
109
Voted
SCN
2008
Springer
15 years 11 days ago
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
Guilhem Castagnos
CRYPTO
2010
Springer
170views Cryptology» more  CRYPTO 2010»
14 years 9 months ago
Securing Computation against Continuous Leakage
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Shafi Goldwasser, Guy N. Rothblum