Sciweavers

1562 search results - page 158 / 313
» Mathematics, Cryptology, Security
Sort
View
CTRSA
2006
Springer
129views Cryptology» more  CTRSA 2006»
15 years 9 months ago
An Optimal Non-interactive Message Authentication Protocol
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...
Sylvain Pasini, Serge Vaudenay
173
Voted
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
15 years 9 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
EUROCRYPT
2006
Springer
15 years 9 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
EUROCRYPT
2006
Springer
15 years 9 months ago
How to Strengthen Pseudo-random Generators by Using Compression
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
Aline Gouget, Hervé Sibert
EUROCRYPT
2006
Springer
15 years 9 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai