Sciweavers

ASIACRYPT
2001
Springer
13 years 12 months ago
Provable Security of KASUMI and 3GPP Encryption Mode f8
Within the security architecture of the 3GPP system there is a standardised encryption mode f8 based on the block cipher KASUMI. In this work we examine the pseudorandomness of the...
Ju-Sung Kang, Sang Uk Shin, Dowon Hong, Okyeon Yi
ASIACRYPT
2001
Springer
13 years 12 months ago
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
Craig Gentry, Jakob Jonsson, Jacques Stern, Michae...
ASIACRYPT
2001
Springer
13 years 12 months ago
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
We present an algorithm for counting points on superelliptic curves yr = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorit...
Pierrick Gaudry, Nicolas Gürel
ASIACRYPT
2001
Springer
13 years 12 months ago
Supersingular Curves in Cryptography
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
Steven D. Galbraith
ASIACRYPT
2001
Springer
13 years 12 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
ASIACRYPT
2001
Springer
13 years 12 months ago
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Abstract. Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is o...
Pierre-Alain Fouque, David Pointcheval
ASIACRYPT
2001
Springer
13 years 12 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
ASIACRYPT
2001
Springer
13 years 12 months ago
The Modular Inversion Hidden Number Problem
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
Dan Boneh, Shai Halevi, Nick Howgrave-Graham
ASIACRYPT
2001
Springer
13 years 12 months ago
Key-Privacy in Public-Key Encryption
We consider a novel security requirement of encryption schemes that we call “key-privacy” or “anonymity”. It asks that an eavesdropper in possession of a ciphertext not be ...
Mihir Bellare, Alexandra Boldyreva, Anand Desai, D...
ASIACRYPT
2001
Springer
13 years 12 months ago
Oblivious Polynomial Evaluation and Oblivious Neural Learning
Yan-Cheng Chang, Chi-Jen Lu