Sciweavers

1656 search results - page 98 / 332
» Secure Computation Without Authentication
Sort
View
AMC
2007
134views more  AMC 2007»
15 years 25 days ago
An image fragile watermark scheme based on chaotic image pattern and pixel-pairs
Fragile watermarking techniques for digital content have been studied in the past few years. Fragile watermarks are used to determine if a piece of watermarked digital content has...
Shaohui Liu, Hongxun Yao, Wen Gao, Yongliang Liu
109
Voted
TIT
2008
187views more  TIT 2008»
15 years 4 days ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
81
Voted
IFIP
2009
Springer
14 years 10 months ago
Attack, Solution and Verification for Shared Authorisation Data in TCG TPM
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers achieve greater security. Proof of possession of authorisation values known as authdata is require...
Liqun Chen, Mark Ryan
FOCS
2006
IEEE
15 years 6 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...
176
Voted

Publication
152views
15 years 3 months ago
Expected loss analysis of thresholded authentication protocols in noisy conditions
A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting $n$ rounds, with no error corr...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...