Sciweavers

222 search results - page 29 / 45
» How to Forget a Secret
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Hidden communication in P2P networks Steganographic handshake and broadcast
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
Raphael Eidenbenz, Thomas Locher, Roger Wattenhofe...
FOCS
2006
IEEE
15 years 4 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
EUROCRYPT
2005
Springer
15 years 3 months ago
Secure Remote Authentication Using Biometric Data
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafai...
FC
2005
Springer
143views Cryptology» more  FC 2005»
15 years 3 months ago
Risk Assurance for Hedge Funds Using Zero Knowledge Proofs
Abstract. This work introduces a new tool for a fund manager to verifiably communicate portfolio risk characteristics to an investor. We address the classic dilemma: How can an in...
Michael Szydlo
ISF
2006
118views more  ISF 2006»
14 years 10 months ago
Does information security attack frequency increase with vulnerability disclosure? An empirical analysis
Abstract Research in information security, risk management and investment has grown in importance over the last few years. However, without reliable estimates on attack probabiliti...
Ashish Arora, Anand Nandkumar, Rahul Telang