Sciweavers

406 search results - page 14 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
110
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
Verifiable Random Functions from Identity-Based Key Encapsulation
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
Michel Abdalla, Dario Catalano, Dario Fiore
95
Voted
STOC
1993
ACM
82views Algorithms» more  STOC 1993»
15 years 4 months ago
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Nathan Linial, Michael Luby, Michael E. Saks, Davi...
82
Voted
JSS
2008
86views more  JSS 2008»
15 years 18 days ago
A backtracking search tool for constructing combinatorial test suites
Jun Yan, Jian Zhang 0001
121
Voted
CCS
2010
ACM
14 years 9 months ago
Practical leakage-resilient pseudorandom generators
Cryptographic systems and protocols are the core of many Internet security procedures (such as SSL, SSH, IPSEC, DNSSEC, secure mail, etc.). At the heart of all cryptographic funct...
Yu Yu, François-Xavier Standaert, Olivier P...