8 Result(s)
within
English
Cryptology
Management of Computing and Information Systems
Andy Rupp
-
Chapter and Conference Paper
Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
In a selective-opening (SO) attack on an encryption scheme, an adversary \(A\) ...
-
Chapter and Conference Paper
Fault-Tolerant Aggregate Signatures
Aggregate signature schemes allow for the creation of a short aggregate of multiple signatures. This feature leads to significant reductions of bandwidth and storage space in sensor networks, secure routing pr...
-
Chapter and Conference Paper
Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
In this paper, we investigate on threshold proofs, a framework for distributing the prover’s side of interactive proofs of knowledge over multiple parties. Interactive proofs of knowledge (PoK) are widely used pr...
-
Chapter and Conference Paper
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
In pairing-based cryptography the Generic Group Model (GGM) is used frequently to provide evidence towards newly introduced hardness assumptions. Unfortunately, the GGM does not reflect many known properties o...
-
Chapter and Conference Paper
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
When verifying digital signatures, achieving a high throughput can be crucial. We present a technique that is useful for ECDSA and DSA signatures. It assumes that common domain parameters are used (which is ty...
-
Chapter and Conference Paper
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
The generic group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still t...
-
Chapter and Conference Paper
A Hardware-Assisted Realtime Attack on A5/2 Without Precomputations
A5/2 is a synchronous stream cipher that is used for protecting GSM communication. Recently, some powerful attacks [2,5] on A5/2 have been proposed. In this contribution we enhance the ciphertext-only attack [...
-
Chapter and Conference Paper
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides some evidence towards the validity of th...
