Sciweavers

Share
EUROCRYPT
2007
Springer
9 years 4 months ago
Batch Verification of Short Signatures
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
Jan Camenisch, Susan Hohenberger, Michael Ø...
EUROCRYPT
2007
Springer
9 years 4 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
EUROCRYPT
2007
Springer
9 years 4 months ago
Revisiting the Efficiency of Malicious Two-Party Computation
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
David P. Woodruff
EUROCRYPT
2007
Springer
9 years 4 months ago
Efficient Two-Party Secure Computation on Committed Inputs
Stanislaw Jarecki, Vitaly Shmatikov
EUROCRYPT
2007
Springer
9 years 4 months ago
Cryptanalysis of SFLASH with Slightly Modified Parameters
SFLASH is a signature scheme which belongs to a family of multivariate schemes proposed by Patarin et al. in 1998 [9]. The SFLASH scheme itself has been designed in 2001 [8] and ha...
Vivien Dubois, Pierre-Alain Fouque, Jacques Stern
EUROCRYPT
2007
Springer
9 years 4 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
EUROCRYPT
2007
Springer
9 years 4 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
EUROCRYPT
2007
Springer
9 years 4 months ago
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
Ueli M. Maurer, Johan Sjödin
EUROCRYPT
2007
Springer
9 years 4 months ago
Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy
This paper shows that Py and Pypy are practically insecure. If one key is used with about 216 IVs with special differences, with high probability two identical keystreams will appe...
Hongjun Wu, Bart Preneel
EUROCRYPT
2007
Springer
9 years 6 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
books