Sciweavers

87 search results - page 16 / 18
» Two Generic Constructions of Probabilistic Cryptosystems and...
Sort
View
DSN
2007
IEEE
13 years 11 months ago
Bounding Peer-to-Peer Upload Traffic in Client Networks
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
Chun-Ying Huang, Chin-Laung Lei
KI
2008
Springer
13 years 7 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
14 years 2 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 1 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
INFOVIS
1995
IEEE
13 years 11 months ago
The information mural: a technique for displaying and navigating large information spaces
Visualizations which depict entire information spaces provide context for navigation and browsing tasks; however, the limited size of the display screen makes creating effective g...
Dean F. Jerding, John T. Stasko