Sciweavers

1562 search results - page 58 / 313
» Mathematics, Cryptology, Security
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
CRYPTO
2000
Springer
184views Cryptology» more  CRYPTO 2000»
14 years 13 days ago
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator ca...
Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene ...
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
14 years 11 days ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
EUROCRYPT
1998
Springer
14 years 9 days ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
FC
2006
Springer
99views Cryptology» more  FC 2006»
13 years 11 months ago
A Protocol for Secure Public Instant Messaging
Although Instant Messaging (IM) services are now relatively long-standing and very popular as an instant way of communication over the Internet, they have received little attention...
Mohammad Mannan, Paul C. van Oorschot