Sciweavers

76 search results - page 11 / 16
» Confirmer Signature Schemes Secure against Adaptive Adversar...
Sort
View
EUROCRYPT
2003
Springer
15 years 2 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
HOST
2008
IEEE
15 years 4 months ago
IC Activation and User Authentication for Security-Sensitive Systems
—A number of applications depend on the protection of security-sensitive hardware, preventing unauthorized users from gaining access to the functionality of the integrated circui...
Jiawei Huang, John Lach
JOC
2006
69views more  JOC 2006»
14 years 9 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
ASIACRYPT
2009
Springer
15 years 4 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...