Sciweavers

1562 search results - page 38 / 313
» Mathematics, Cryptology, Security
Sort
View
EUROCRYPT
2006
Springer
13 years 11 months ago
Luby-Rackoff Ciphers from Weak Round Functions?
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived fr...
Ueli M. Maurer, Yvonne Anne Oswald, Krzysztof Piet...
EUROCRYPT
2000
Springer
13 years 11 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail
ACNS
2010
Springer
155views Cryptology» more  ACNS 2010»
13 years 11 months ago
Redactable Signatures for Tree-Structured Data: Definitions and Constructions
ded abstract of this paper appears in Applied Cryptography and Network Security
Christina Brzuska, Heike Busch, Özgür Da...
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 10 months ago
Security of Blind Signatures Revisited
We revisit the deļ¬nition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established deļ¬...
Dominique Schröder, Dominique Unruh
ASIACRYPT
2004
Springer
14 years 1 months ago
On Provably Secure Time-Stamping Schemes
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
Ahto Buldas, Märt Saarepera