Sciweavers

465 search results - page 36 / 93
» Programmable Hash Functions and Their Applications
Sort
View
ICFP
2004
ACM
15 years 10 months ago
Slideshow: functional presentations
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
Robert Bruce Findler, Matthew Flatt
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 1 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
CRYPTO
2012
Springer
237views Cryptology» more  CRYPTO 2012»
13 years 12 days ago
Tweakable Blockciphers with Beyond Birthday-Bound Security
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...
Will Landecker, Thomas Shrimpton, R. Seth Terashim...
FPL
2004
Springer
103views Hardware» more  FPL 2004»
15 years 3 months ago
Automating Optimized Table-with-Polynomial Function Evaluation for FPGAs
Abstract. Function evaluation is at the core of many compute-intensive applications which perform well on reconfigurable platforms. Yet, in order to implement function evaluation ...
Dong-U Lee, Oskar Mencer, David J. Pearce, Wayne L...
ICFP
2007
ACM
15 years 10 months ago
Tangible functional programming
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
Conal Elliott