Sciweavers

550 search results - page 96 / 110
» Public Key Encryption and Encryption Emulation Attacks
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 9 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
NSDI
2007
13 years 11 months ago
Information Slicing: Anonymity Using Unreliable Overlays
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
Sachin Katti, Jeff Cohen, Dina Katabi
IJISEC
2010
159views more  IJISEC 2010»
13 years 6 months ago
A generalization of Paillier's public-key system with applications to electronic voting
We propose a generalization of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme e...
Ivan Damgård, Mads Jurik, Jesper Buus Nielse...
EUROCRYPT
1998
Springer
14 years 1 months ago
Divertible Protocols and Atomic Proxy Cryptography
Abstract. First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a defi...
Matt Blaze, Gerrit Bleumer, Martin Strauss
LATINCRYPT
2010
13 years 7 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...