Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EUROCRYPT
2000
Springer
10 years 5 months ago
On the Security of 3GPP Networks
Michael Walker
EUROCRYPT
2000
Springer
10 years 5 months ago
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...
Palash Sarkar, Subhamoy Maitra
EUROCRYPT
2000
Springer
10 years 5 months ago
A Composition Theorem for Universal One-Way Hash Functions
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed...
Victor Shoup
EUROCRYPT
2000
Springer
10 years 5 months ago
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
Victor Shoup
EUROCRYPT
2000
Springer
10 years 5 months ago
Practical Threshold Signatures
We present an RSA threshold signature scheme. The scheme enjoys the following properties:
Victor Shoup
EUROCRYPT
2000
Springer
10 years 5 months ago
Fair Encryption of RSA Keys
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
Guillaume Poupard, Jacques Stern
EUROCRYPT
2000
Springer
10 years 5 months ago
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider in...
Ueli M. Maurer, Stefan Wolf
EUROCRYPT
2000
Springer
10 years 5 months ago
The Sum of PRPs Is a Secure PRF
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...
Stefan Lucks
EUROCRYPT
2000
Springer
10 years 5 months ago
Analysis and Optimization of the TWINKLE Factoring Device
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
Arjen K. Lenstra, Adi Shamir
EUROCRYPT
2000
Springer
10 years 5 months ago
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
Eyal Kushilevitz, Rafail Ostrovsky
books