Sciweavers

659 search results - page 47 / 132
» Compiling and securing cryptographic protocols
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
15 years 3 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
ICSE
2008
IEEE-ACM
16 years 2 months ago
Security protocols, properties, and their monitoring
This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...
Andreas Bauer 0002, Jan Jürjens
128
Voted
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
15 years 4 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
130
Voted
ACSAC
2000
IEEE
15 years 7 months ago
Efficient Commerce Protocols based on One-Time Pads
We present a new commerce protocol that allows customers and merchants to conduct face-to-face creditcard authorizations with a credit card company securely with the option of ano...
Michael A. Schneider, Edward W. Felten
USS
2010
15 years 11 days ago
Structuring Protocol Implementations to Protect Sensitive Data
In a bid to limit the harm caused by ubiquitous remotely exploitable software vulnerabilities, the computer systems security community has proposed primitives to allow execution o...
Petr Marchenko, Brad Karp