Sciweavers

14 search results - page 3 / 3
» Random Access to Advice Strings and Collapsing Results
Sort
View
BMCBI
2008
214views more  BMCBI 2008»
13 years 5 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
ASIACRYPT
2000
Springer
13 years 9 months ago
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
Danny Gutfreund, Michael Ben-Or
EUROCRYPT
2007
Springer
13 years 11 months ago
Mesh Signatures
sion of an extended abstract to be published in Advances in Cryptology—EUROCRYPT 2007, Springer-Verlag, 2007. Available online from the IACR Cryptology ePrint Archive as Report 2...
Xavier Boyen
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 6 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao