Sciweavers

36 search results - page 6 / 8
» Secret Sharing Schemes for Very Dense Graphs
Sort
View
DEXAW
2009
IEEE
124views Database» more  DEXAW 2009»
14 years 15 days ago
Performance Comparison of Secure Comparison Protocols
Secure Multiparty Computation (SMC) has gained tremendous importance with the growth of the Internet and E-commerce, where mutually untrusted parties need to jointly compute a fun...
Florian Kerschbaum, Debmalya Biswas, Sebastiaan de...
JOC
2007
133views more  JOC 2007»
13 years 5 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
13 years 11 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 5 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...
EUROCRYPT
1995
Springer
13 years 9 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail