Sciweavers

298 search results - page 50 / 60
» Strong Anonymous Signatures
Sort
View
ICALP
2005
Springer
14 years 27 days ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
IH
2005
Springer
14 years 26 days ago
Censorship Resistance Revisited
Abstract. “Censorship resistant” systems attempt to prevent censors from imposing a particular distribution of content across a system. In this paper, we introduce a variation ...
Ginger Perng, Michael K. Reiter, Chenxi Wang
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
13 years 11 months ago
Incremental cryptography and application to virus protection
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
Mihir Bellare, Oded Goldreich, Shafi Goldwasser
IACR
2011
136views more  IACR 2011»
12 years 7 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ICIP
2007
IEEE
14 years 1 months ago
Structural Texture Segmentation using Affine Symmetry
Many natural textures comprise structural patterns and show strong self-similarity. We use affine symmetry to segment an image into self-similar regions; that is a patch of textu...
Heechan Park, Graham R. Martin, Abhir Bhalerao