Sciweavers

162 search results - page 21 / 33
» A Group Signature Scheme from Lattice Assumptions
Sort
View
CCS
2006
ACM
15 years 2 months ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven
TIFS
2010
130views more  TIFS 2010»
14 years 5 months ago
On the Insecurity of Proactive RSA in the URSA Mobile Ad Hoc Network Access Control Protocol
Access control is the fundamental security service in ad hoc groups. It is needed not only to prevent unauthorized entities from joining the group, but also to bootstrap other secu...
Stanislaw Jarecki, Nitesh Saxena
EUROCRYPT
2000
Springer
15 years 2 months ago
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
Daniel Bleichenbacher, Phong Q. Nguyen
ASIACRYPT
2004
Springer
15 years 4 months ago
Secret Handshakes from CA-Oblivious Encryption
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
Claude Castelluccia, Stanislaw Jarecki, Gene Tsudi...
ASIACRYPT
2003
Springer
15 years 4 months ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern