Sciweavers

2846 search results - page 12 / 570
» Not one click for security
Sort
View
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 9 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
129
Voted
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
16 years 10 days ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis
119
Voted
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 10 months ago
On the Security of Goldreich's One-Way Function
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
Andrej Bogdanov, Youming Qiao
121
Voted
AINA
2005
IEEE
15 years 9 months ago
Secure One-Round Tripartite Authenticated Key Agreement Protocol from Weil Pairing
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...
Chu-Hsing Lin, Hsiu-Hsia Lin
150
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov