Sciweavers

7924 search results - page 120 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 9 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
COLING
2010
13 years 4 months ago
Hungarian Corpus of Light Verb Constructions
The precise identification of light verb constructions is crucial for the successful functioning of several NLP applications. In order to facilitate the development of an algorith...
Veronika Vincze, János Csirik
LATIN
2010
Springer
14 years 3 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
SP
2003
IEEE
14 years 2 months ago
Hardening Functions for Large Scale Distributed Computations
Many recent large-scale distributed computing applications utilize spare processor cycles of personal computers that are connected to the Internet. The resulting distributed compu...
Doug Szajda, Barry G. Lawson, Jason Owen
ICFP
2009
ACM
14 years 9 months ago
Safe functional reactive programming through dependent types
Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchr...
Neil Sculthorpe, Henrik Nilsson