Sciweavers

87 search results - page 6 / 18
» A Verifiable Random Function with Short Proofs and Keys
Sort
View
84
Voted
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Simulatable VRFs with Applications to Multi-theorem NIZK
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
Melissa Chase, Anna Lysyanskaya
BMCBI
2006
123views more  BMCBI 2006»
14 years 9 months ago
Permutation test for periodicity in short time series data
Background: Periodic processes, such as the circadian rhythm, are important factors modulating and coordinating transcription of genes governing key metabolic pathways. Theoretica...
Andrey A. Ptitsyn, Sanjin Zvonic, Jeffrey M. Gimbl...
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
15 years 4 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
INFOCOM
2009
IEEE
15 years 4 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
86
Voted
TCC
2005
Springer
113views Cryptology» more  TCC 2005»
15 years 3 months ago
Entropic Security and the Encryption of High Entropy Messages
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
Yevgeniy Dodis, Adam Smith