![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Formal Methods Analysis of the Secure Remote Password Protocol
We analyze the Secure Remote Password (SRP) protocol for structural weaknesses using the Cryptographic Protocol Shapes Analyzer (CPSA) in the first formal analysis of SRP (specifically, Version 3).
-
Article
Open AccessTweakable Block Ciphers
A common trend in applications of block ciphers over the past decades has been to employ block ciphers as one piece of a “mode of operation”—possibly, a way to make a secure symmetric-key cryptosystem, but mor...
-
Chapter and Conference Paper
On Related-Secret Pseudorandomness
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among keys to circumvent security pro...
-
Article
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
This paper presents the time-bounded task-PIOA modeling framework, an extension of the probabilistic input/output automata (PIOA) framework that can be used for modeling and verifying security protocols. Time-...
-
Chapter and Conference Paper
Online-Untransferable Signatures
Non-transferability of digital signatures is an important security concern, traditionally achieved via interactive verification protocols. Such protocols, however, are vulnerable to “online transfer attacks” —...
-
Chapter and Conference Paper
Constructing an Ideal Hash Function from Weak Ideal Compression Functions
We introduce the notion of a weak ideal compression function, which is vulnerable to strong forms of attack, but is otherwise random. We show that such weak ideal compression functions can be used to create secur...
-
Chapter and Conference Paper
On Tweaking Luby-Rackoff Blockciphers
Tweakable blockciphers, first formalized by Liskov, Rivest, and Wagner [12], are blockciphers with an additional input, the tweak, which allows for variability. An open problem proposed by Liskov et al. is how to...
-
Chapter and Conference Paper
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
We present the Time-Bounded Task-PIOA modeling framework, an extension of the Probabilistic I/O Automata (PIOA) framework that is intended to support modeling and verification of security protocols. Time-Bounded ...
-
Reference Work Entry In depth
Miller–Rabin Probabilistic Primality Test
-
Reference Work Entry In depth
Fermat's Little Theorem
-
Reference Work Entry In depth
Fermat Primality Test
-
Reference Work Entry In depth
Maurer's Method
-
Chapter and Conference Paper
Updatable Zero-Knowledge Databases
Micali, Rabin, and Kilian [9] recently introduced zero- knowledge sets and databases, in which a prover sets up a database by publishing a commitment, and then gives proofs about particular values. While an el...
-
Chapter and Conference Paper
Plaintext Awareness via Key Registration
In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintext-aware encryption without random oracl...
-
Chapter and Conference Paper
Amortized E-Cash
We present an e-cash scheme which provides a trade-off between anonymity and efficiency, by amortizing the cost of zero-knowledge and signature computation in the cash generation phase.
-
Chapter and Conference Paper
Tweakable Block Ciphers
We propose a new cryptographic primitive, the “tweakable block cipher.” Such a cipher has not only the usual inputs — message and cryptographic key — but also a third input, the “tweak.” The tweak serves much the...
-
Chapter and Conference Paper
Mutually Independent Commitments
We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they do not guarantee independence ...
-
Chapter and Conference Paper
Efficient Finite Field Basis Conversion Involving dual bases
Conversion of finite field elements from one basis representation to another representation in a storage-efficient manner is crucial if these techniques are to be carried out in hardware for cryptographic appl...