Sciweavers

204 search results - page 18 / 41
» On Provably Secure Time-Stamping Schemes
Sort
View
CSR
2009
Springer
14 years 2 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
JOC
2006
116views more  JOC 2006»
13 years 7 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
DBSEC
2008
89views Database» more  DBSEC 2008»
13 years 9 months ago
A New Approach to Secure Logging
Abstract. The need for secure logging is well-understood by the security professionals, including both researchers and practitioners. The ability to efficiently verify all (or some...
Di Ma, Gene Tsudik
ICC
2007
IEEE
165views Communications» more  ICC 2007»
14 years 2 months ago
Oblivious Keyword Search Protocols in the Public Database Model
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
Huafei Zhu, Feng Bao
CCS
2001
ACM
14 years 10 days ago
Practical forward secure group signature schemes
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
Dawn Xiaodong Song