Sciweavers

53 search results - page 4 / 11
» crypto 2000
Sort
View
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
CRYPTO
2000
Springer
89views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
On the Round Security of Symmetric-Key Cryptographic Primitives
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
Zulfikar Ramzan, Leonid Reyzin
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Efficient Non-malleable Commitment Schemes
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
Marc Fischlin, Roger Fischlin
PKC
2001
Springer
163views Cryptology» more  PKC 2001»
14 years 2 months ago
Fast Irreducibility and Subgroup Membership Testing in XTR
Abstract. We describe a new general method to perform part of the setup stage of the XTR system introduced at Crypto 2000, namely finding the trace of a generator of the XTR group...
Arjen K. Lenstra, Eric R. Verheul
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
Anand Desai