Sciweavers

2421 search results - page 32 / 485
» Message from the Co-Chairs
Sort
View
CATS
2007
13 years 9 months ago
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
Tomoyuki Yamakami
PROVSEC
2010
Springer
13 years 5 months ago
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
Laila El Aimani
CIE
2008
Springer
13 years 9 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
IJNSEC
2011
108views more  IJNSEC 2011»
13 years 2 months ago
Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
Mingwu Zhang, Bo Yang, Yusheng Zhong, Pengcheng Li...
PERCOM
2003
ACM
14 years 7 months ago
Pervasive Messaging
Pervasive messaging is the part of pervasive computing that enables users to communicate with each other. Many of today's electronic messaging systems have their own distinct...
Jan-Mark S. Wams, Maarten van Steen