Sciweavers

370 search results - page 12 / 74
» Limits of Constructive Security Proofs
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
ESWA
2008
155views more  ESWA 2008»
13 years 8 months ago
Using GHSOM to construct legal maps for Taiwan's securities and futures markets
A good legal knowledge representation system, capable of effectively providing investors with comprehensive legal knowledge, is needed for investors to prevent erratic behavior be...
Jen-Ying Shih, Yu-Jung Chang, Wun-Hwa Chen
ACNS
2006
Springer
112views Cryptology» more  ACNS 2006»
14 years 2 months ago
Password Based Server Aided Key Exchange
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...
Yvonne Cliff, Yiu Shing Terry Tin, Colin Boyd
ICICS
2010
Springer
13 years 6 months ago
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme
Due to the rapid growth of e-commerce technology, secure auction protocols have attracted much attention among researchers. The main reason for constructing sealed-bid auction prot...
Mehrdad Nojoumian, Douglas R. Stinson
SOUPS
2009
ACM
14 years 2 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor