Sciweavers

658 search results - page 69 / 132
» Open problems in the security of learning
Sort
View
ACISP
2005
Springer
14 years 2 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
ASIACRYPT
2000
Springer
14 years 1 months ago
Zero-Knowledge and Code Obfuscation
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
Satoshi Hada
WWCA
1998
Springer
14 years 1 months ago
Compact and Flexible Resolution of CBT Multicast Key-Distribution
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
Kanta Matsuura, Yuliang Zheng, Hideki Imai
COMCOM
2002
105views more  COMCOM 2002»
13 years 8 months ago
An intensive survey of fair non-repudiation protocols
With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. Nonrepudiation services m...
Steve Kremer, Olivier Markowitch, Jianying Zhou
ACSAC
2001
IEEE
14 years 20 days ago
Privacy-Preserving Cooperative Statistical Analysis
The growth of the Internet opens up tremendous opportunities for cooperative computation, where the answer depends on the private inputs of separate entities. Sometimes these comp...
Wenliang Du, Mikhail J. Atallah