Sciweavers

3328 search results - page 344 / 666
» On Plateaued Functions and Their Constructions
Sort
View
ESOP
2009
Springer
16 years 1 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
FOCS
2007
IEEE
16 years 1 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
16 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
TLCA
2007
Springer
16 years 28 days ago
Weakly Distributive Domains
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
Ying Jiang, Guo-Qiang Zhang
INFOCOM
2005
IEEE
16 years 12 days ago
Smart power-saving mode for IEEE 802.11 wireless LANs
StaticPSM (Power-Saving Mode)schemes employed in the current IEEE 802.11 implementations could not provide any delag-performance guarantee because of their fixed wakeup intervals. ...
Daji Qiao, Kang G. Shin