Sciweavers

6164 search results - page 794 / 1233
» Teaching Computer Security
Sort
View
IADIS
2003
15 years 7 months ago
Anti-Sniffing in Unbounded Networks
Along with the trend in networked computing environments towards largely unbounded network infrastructures, the traditional anti-sniffing issue meets a great challenge. This paper...
Xiu-guo Bao, Ming-zheng Hu, Xiao-chun Yun, Ri Ding
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 6 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
ENTCS
2006
138views more  ENTCS 2006»
15 years 6 months ago
Model Checking Russian Cards
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van...
144
Voted
CORR
2010
Springer
87views Education» more  CORR 2010»
15 years 5 months ago
Quantum money from knots
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the sta...
Edward Farhi, David Gosset, Avinatan Hassidim, And...
ASIACRYPT
2010
Springer
15 years 4 months ago
Efficient String-Commitment from Weak Bit-Commitment
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Ya...