Sciweavers

659 search results - page 66 / 132
» Compiling and securing cryptographic protocols
Sort
View
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 6 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
125
Voted
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 2 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
88
Voted
ACNS
2009
Springer
143views Cryptology» more  ACNS 2009»
15 years 7 months ago
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
STORAGESS
2006
ACM
15 years 6 months ago
Scalable security for large, high performance storage systems
New designs for petabyte-scale storage systems are now capable of transferring hundreds of gigabytes of data per second, but lack strong security. We propose a scalable and effici...
Andrew W. Leung, Ethan L. Miller
119
Voted
CCS
2010
ACM
14 years 9 months ago
Practical leakage-resilient pseudorandom generators
Cryptographic systems and protocols are the core of many Internet security procedures (such as SSL, SSH, IPSEC, DNSSEC, secure mail, etc.). At the heart of all cryptographic funct...
Yu Yu, François-Xavier Standaert, Olivier P...