Sciweavers

122 search results - page 2 / 25
» Achieving Security Despite Compromise Using Zero-knowledge
Sort
View
ASIACRYPT
2000
Springer
13 years 9 months ago
Zero-Knowledge and Code Obfuscation
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
Satoshi Hada
IACR
2011
152views more  IACR 2011»
12 years 4 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
13 years 11 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh
SOUPS
2006
ACM
13 years 10 months ago
Aligning usability and security: a usability study of Polaris
Security software is often difficult to use thus leading to poor adoption and degraded security. This paper describes a usability study that was conducted on the software ‘Polar...
Alexander J. DeWitt, Jasna Kuljis
ICDCS
2009
IEEE
14 years 2 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu