Sciweavers

76 search results - page 3 / 16
» Pseudorandom Generators for Group Products
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...
MST
2011
182views Hardware» more  MST 2011»
13 years 3 months ago
Tilings and Submonoids of Metabelian Groups
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
Markus Lohrey, Benjamin Steinberg
COCO
1997
Springer
127views Algorithms» more  COCO 1997»
14 years 18 days ago
A Nonadaptive NC Checker for Permutation Group Intersection
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
Vikraman Arvind, Jacobo Torán
NORDSEC
2009
Springer
14 years 3 months ago
Facilitating the Adoption of Tor by Focusing on a Promising Target Group
The technology for anonymous communication has been thoroughly researched. But despite the existence of several protection services, a business model for anonymous web surfing has ...
Heiko Roßnagel, Jan Zibuschka, Lexi Pimenidi...
CBMS
2008
IEEE
13 years 10 months ago
Generating GO Slim Using Relational Database Management Systems to Support Proteomics Analysis
The Gene Ontology Consortium built the Gene Ontology database (GO) to address the need for a common standard in naming genes and gene products. Using different names for the same ...
Getiria Onsongo, Hongwei Xie, Timothy J. Griffin, ...