948 search results - page 146 / 190 » Attacking cryptographic schemes based on |
IMA
1995
Springer
13 years 11 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
MMSEC
2004
ACM
14 years 1 months ago
2004
ACM
Protection of digital multimedia content has become an increasingly important issue for content owners and service providers. As watermarking is identified as a major technology t...
EUROCRYPT
2012
Springer
11 years 10 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ËœO(Î...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...