Sciweavers

488 search results - page 95 / 98
» Policy-Based Cryptography and Applications
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
ICSE
2000
IEEE-ACM
13 years 11 months ago
Software engineering for security: a roadmap
Is there such a thing anymore as a software system that doesn't need to be secure? Almost every softwarecontrolled system faces threats from potential adversaries, from Inter...
Premkumar T. Devanbu, Stuart G. Stubblebine
UMC
2000
13 years 11 months ago
Quantum Information: The New Frontier
Quantum information and computation is the new hype in physics. It is promising, mindboggling and even already applicable in cryptography, with good prospects ahead. A brief, rathe...
Karl Svozil