Sciweavers

101 search results - page 17 / 21
» Compact Group Signatures Without Random Oracles
Sort
View
EUROCRYPT
2010
Springer
13 years 7 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 3 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 8 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
ACISP
2007
Springer
13 years 11 months ago
Practical Compact E-Cash
Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-c...
Man Ho Au, Willy Susilo, Yi Mu
EUROCRYPT
2004
Springer
13 years 11 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...