Sciweavers

281 search results - page 13 / 57
» Non-black-box Techniques in Cryptography
Sort
View
112
Voted
ICISC
2007
125views Cryptology» more  ICISC 2007»
15 years 3 months ago
A Cryptanalysis of the Double-Round Quadratic Cryptosystem
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...
Antoine Scemama
114
Voted
FCS
2006
15 years 3 months ago
Quantum Oblivious Transfer Based on POVM Measurements
- Oblivious transfer OT is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any informa...
Wei Yang, Liusheng Huang, Yonglong Luo, Mingjun Xi...
WCE
2007
15 years 3 months ago
A VC-Based Copyright Protection Scheme for Digital Images of Multi-Authorship
—Digital watermarking is a technique for protecting intellectual property of digital information. However, when a work is created by multiple authors, digital watermarking may su...
Shu-Fen Tu, Ching-Sheng Hsu
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
15 years 3 months ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 1 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson