Sciweavers

64 search results - page 12 / 13
» crypto 2006
Sort
View
JOC
2002
99views more  JOC 2002»
15 years 1 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
NAR
2007
75views more  NAR 2007»
15 years 1 months ago
ApiDB: integrated resources for the apicomplexan bioinformatics resource center
ApiDB (http://ApiDB.org) represents a unified entry point for the NIH-funded Apicomplexan Bioinformatics Resource Center (BRC) that integrates numerous database resources and mult...
Cristina Aurrecoechea, Mark Heiges, Haiming Wang, ...
123
Voted
ASIACRYPT
2010
Springer
14 years 11 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
ACNS
2006
Springer
81views Cryptology» more  ACNS 2006»
15 years 7 months ago
A Handy Multi-coupon System
A coupon is an electronic data that represents the right to access a service provided by a service provider (e.g. gift certificates or movie tickets). Recently, a privacyprotectin...
Sébastien Canard, Aline Gouget, Emeline Huf...
109
Voted
ASIACRYPT
2006
Springer
15 years 5 months ago
Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yu...