Sciweavers

369 search results - page 51 / 74
» Security Analysis of Several Group Signature Schemes
Sort
View
EUROCRYPT
2003
Springer
15 years 5 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
CSFW
2010
IEEE
15 years 3 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CRYPTO
2005
Springer
97views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
Generic Transformation for Scalable Broadcast Encryption Schemes
Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many comm...
Jung Yeon Hwang, Dong Hoon Lee, Jongin Lim
ISW
2010
Springer
14 years 9 months ago
An Analysis of DepenDNS
Recently, a new scheme to protect clients against DNS cache poisoning attacks was introduced. The scheme is referred to as DepenDNS and is intended to protect clients against such ...
Nadhem J. AlFardan, Kenneth G. Paterson
ASIACRYPT
2000
Springer
15 years 4 months ago
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
Anand Desai, Sara K. Miner