Sciweavers

127 search results - page 12 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
CSI
2007
54views more  CSI 2007»
13 years 8 months ago
A practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
Jian-jie Zhao, Jianzhong Zhang 0005, Rong Zhao
ICIP
2008
IEEE
14 years 9 months ago
Estimation of optimum coding redundancy and frequency domain analysis of attacks for YASS - a randomized block based hiding sche
Our recently introduced JPEG steganographic method called Yet Another Steganographic Scheme (YASS) can resist blind steganalysis by embedding data in the discrete cosine transform...
Anindya Sarkar, Lakshmanan Nataraj, B. S. Manjunat...
ASIACRYPT
2010
Springer
13 years 6 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
ACNS
2005
Springer
97views Cryptology» more  ACNS 2005»
14 years 1 months ago
Thompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
Vladimir Shpilrain, Alexander Ushakov
MYCRYPT
2005
Springer
123views Cryptology» more  MYCRYPT 2005»
14 years 1 months ago
Optimization of the MOVA Undeniable Signature Scheme
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
Jean Monnerat, Yvonne Anne Oswald, Serge Vaudenay