Sciweavers

1769 search results - page 160 / 354
» Cryptography
Sort
View
121
Voted
DCC
2008
IEEE
16 years 3 months ago
Explicit constructions for perfect hash families
Let k, v, t be integers such that k v t 2. A perfect hash family PHF(N; k, v, t) can be defined as an N ? k array with entries from a set of v symbols such that every N ?t suba...
Sosina Martirosyan, Tran van Trung
125
Voted
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
16 years 28 days ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
ICDCS
2009
IEEE
16 years 21 days ago
Distributed Key Generation for the Internet
Although distributed key generation (DKG) has been studied for some time, it has never been examined outside of the synchronous setting. We present the first realistic DKG archit...
Aniket Kate, Ian Goldberg
144
Voted
ICCAD
2002
IEEE
189views Hardware» more  ICCAD 2002»
16 years 13 days ago
Reversible logic circuit synthesis
Reversible, or information-lossless, circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requir...
Vivek V. Shende, Aditya K. Prasad, Igor L. Markov,...
103
Voted
TCC
2010
Springer
236views Cryptology» more  TCC 2010»
16 years 13 days ago
From Passive to Covert Security at Low Cost
Aumann and Lindell defined security against covert attacks, where the adversary is malicious, but is only caught cheating with a certain probability, where the idea is that in man...
Ivan Damgård, Martin Geisler, Jesper Buus Ni...