-
1
-
-
84921018856
-
A practical and provably secure coalition-resistant group signature scheme
-
[ACJT00]
-
[ACJT00] Ateniese, Camenisch, Joye, Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. CRYPTO 2000, pp. 255-270.
-
CRYPTO 2000
, pp. 255-270
-
-
Ateniese, C.1
Joye, T.2
-
2
-
-
84955599449
-
How to date blind signatures
-
[AF96]
-
[AF96] Abe, Fujisaki, How to Date Blind Signatures, In ASIACRYPT'96, pp. 244-251.
-
ASIACRYPT'96
, pp. 244-251
-
-
Abe, F.1
-
3
-
-
0345490609
-
Efficient group signatures without trapdoors
-
[AM03]
-
[AM03] Ateniese Medeiros. Efficient Group Signatures without Trapdoors. ASI-ACRYPT'03, pp. 246-268.
-
ASI-ACRYPT'03
, pp. 246-268
-
-
Medeiros, A.1
-
4
-
-
0030416137
-
Pseudorandom functions revisited: The cascade construction and its concrete security
-
[BCK03]
-
[BCK03] Bellare, Canetti, Krawczyk. Pseudorandom functions revisited: The cascade construction and its concrete security. FOCS'96, 514-523.
-
FOCS'96
, pp. 514-523
-
-
Bellare1
Canetti, K.2
-
5
-
-
35248843604
-
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
-
[BMW03]
-
[BMW03] Bellare, Micciancio, Warinschi. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions In EUROCRYPT'03, pp. 614-629.
-
EUROCRYPT'03
, pp. 614-629
-
-
Bellare, M.1
Warinschi2
-
6
-
-
24144477851
-
Foundations of group signatures: The case of dynamic groups
-
[BSZ05]
-
[BSZ05] Bellare, Shi Zhang. Foundations of Group Signatures: The Case of Dynamic Groups. CT-RSA'05, pp. 136-153.
-
CT-RSA'05
, pp. 136-153
-
-
Bellare1
Zhang, S.2
-
7
-
-
35048848152
-
Short signatures without random oracles
-
[BB04]
-
[BB04] Boneh, Boyen. Short Signatures Without Random Oracles. EUROCRYPT'04, pp. 56-73.
-
EUROCRYPT'04
, pp. 56-73
-
-
Boneh, B.1
-
8
-
-
35048887476
-
Short group signatures
-
[BBS04]
-
[BBS04] Boneh, Boyen, Shacham. Short Group Signatures. CRYPTO'04, pp. 41-55.
-
CRYPTO'04
, pp. 41-55
-
-
Boneh, B.1
Shacham2
-
9
-
-
84948973732
-
Efficient proofs that a committed number lies in an interval
-
[B00]
-
[B00] Boudot. Efficient Proofs that a Committed Number Lies in an Interval. EUROCRYPT'00, pp 431-444.
-
EUROCRYPT'00
, pp. 431-444
-
-
Boudot1
-
11
-
-
14844295011
-
Direct anonymous attestation
-
[BCC04]
-
[BCC04] Brickell, Camenisch, Chen. Direct Anonymous Attestation. ACMCCS'04, pp. 132-145.
-
ACMCCS'04
, pp. 132-145
-
-
Brickell, C.1
Chen2
-
12
-
-
0001853827
-
Proofs of partial knowledge and simplified design of witness hiding protocols
-
[CDS94]
-
[CDS94] Crarner, Damgård, Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. CRYPTO'94, pp. 174-187.
-
CRYPTO'94
, pp. 174-187
-
-
Crarner, D.1
Schoenmakers2
-
13
-
-
5144226887
-
Easy come - Easy go divisible cash
-
[CFT98]
-
[CFT98] Chan, Frankel, Tsiounis. Easy Come - Easy Go Divisible Cash. EUROCRYPT '98, pp. 614-629.
-
EUROCRYPT '98
, pp. 614-629
-
-
Chan, F.1
Tsiounis2
-
14
-
-
23944501377
-
Group signatures: Botter efficiency and new theoretical aspects
-
[CG04]
-
[CG04] Camenisch, Groth. Group Signatures: Botter Efficiency and New Theoretical Aspects. SCN'04, pp. 120-133.
-
SCN'04
, pp. 120-133
-
-
Camenisch, G.1
-
16
-
-
35248839965
-
A signature scheme with efficient protocols
-
[CL02]
-
[CL02] Camenisch, Lysyanskaya. A Signature Scheme with Efficient Protocols. SCN'02, pp. 268-289.
-
SCN'02
, pp. 268-289
-
-
Camenisch, L.1
-
17
-
-
35048845114
-
Signature schemes and anonymous credentials from bilinear maps
-
[CL04]
-
[CL04] Camenisch, Lysyanskaya. Signature Schemes and Anonymous Credentials from Bilinear Maps. CRYPTO'04, pp. 56-72.
-
CRYPTO'04
, pp. 56-72
-
-
Camenisch, L.1
-
19
-
-
84990195007
-
Transferred cash grows in size
-
[CP92]
-
[CP92] Chaum,Pedersen.Transferred Cash Grows in Size, EUROCRYPT'92, pp.390-407
-
EUROCRYPT'92
, pp. 390-407
-
-
Pedersen, C.1
-
20
-
-
33745807651
-
List signature schemes and application to electronic voting
-
[CT03]
-
[CT03] Canard, Traoré. List Signature Schemes and Application to Electronic Voting. International Workshop on Coding and Cryptography 2003, pp.24-28.
-
(2003)
International Workshop on Coding and Cryptography
, pp. 24-28
-
-
Canard, T.1
-
22
-
-
84867553981
-
A generalization, a simplification and some applications of paillier's probabilistic public-key system
-
[DJ01]
-
[DJ01] Damgard Jurik. A Generalization, a Simplification and Some Applications of Paillier's Probabilistic Public-key system. PKC'01. pp. 119-136.
-
PKC'01
, pp. 119-136
-
-
Jurik, D.1
-
23
-
-
33745828152
-
Expanding pseudorandom functions; or: From known-plaintext security to chosen-plaintext security
-
[DN02]
-
[DN02] Damgard, Nielsen. Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. CRYPTO'02, pp.449-464.
-
CRYPTO'02
, pp. 449-464
-
-
Damgard, N.1
-
24
-
-
24144481228
-
A verifiable random function with short proofs and keys
-
[DY05]
-
[DY05] Dodis, Yampolskiy. A Verifiable Random Function with Short Proofs and Keys. PKC'05, pp.416-431
-
PKC'05
, pp. 416-431
-
-
Dodis, Y.1
-
25
-
-
26444446884
-
An efficient group signature scheme from bilinear maps
-
[FI05]
-
[FI05] Furukawa, Imai. An Efficient Group Signature Scheme from Bilinear Maps. ACISP'05, pp.455-467.
-
ACISP'05
, pp. 455-467
-
-
Furukawa, I.1
-
26
-
-
84880857711
-
An efficient scheme for proving a shuffle
-
[FS01]
-
[FS01] Furukawa, Sako. An Efficient Scheme for Proving a Shuffle. CRYPTO'01,pp. 368-387.
-
CRYPTO'01
, pp. 368-387
-
-
Furukawa, S.1
-
27
-
-
0022793132
-
How to construct random function
-
[GGM86]
-
[GGM86] Goldreich, Goldwasser, Micali. How to construct random function. J.ACM. 33(4): pp.797-807, 1986.
-
(1986)
J.ACM.
, vol.33
, Issue.4
, pp. 797-807
-
-
Goldreich, G.1
Micali2
-
29
-
-
24944524118
-
Group signatures with efficient concurrent join
-
[KY05] Full version
-
[KY05] A. Kiayias, M. Yuug. Group Signatures with Efficient Concurrent Join. EUROCRYPT'05 pp. 198-214. Full version: http://eprint.iacr.org/2005/345.
-
EUROCRYPT'05
, pp. 198-214
-
-
Kiayias, A.1
Yuug, M.2
-
30
-
-
0036475666
-
A new traitor tracing
-
[MSK02]
-
[MSK02] Mitsunari, Sakai, Kasahara. A new traitor tracing. IEICE Trans. Vol. E85-A, No.2, pp.481-484, 2002.
-
(2002)
IEICE Trans.
, vol.E85-A
, Issue.2
, pp. 481-484
-
-
Mitsunari, S.1
Kasahara2
-
31
-
-
84948140143
-
Unlinkable electronic coupon protocol with anonymity control
-
[NHS99]
-
[NHS99] Nakanishi, Haruna, Sugiyama. Unlinkable Electronic Coupon Protocol with Anonymity Control, ISW'99, pp. 37-46.
-
ISW'99
, pp. 37-46
-
-
Nakanishi, H.1
Sugiyama2
-
32
-
-
0031332843
-
Number-theoretic constructions of efficient pseudo-random functions
-
[NR97]
-
[NR97] Naor Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. FOCS'97. pp.458-467.
-
FOCS'97
, pp. 458-467
-
-
Reingold, N.1
-
33
-
-
33645594520
-
Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings
-
[NN04]
-
[NN04] Nguyen, Safavi-Naini. Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings. ASIACRYPT'04, pp. 316-337.
-
ASIACRYPT'04
, pp. 316-337
-
-
Nguyen, S.-N.1
-
34
-
-
26444607972
-
Dynamic k-times anonymous authentication
-
[NN05]
-
[NN05] Nguyen, Safavi-Naini. Dynamic k-Times Anonymous Authentication. ACNS'05, pp. 318-333.
-
ACNS'05
, pp. 318-333
-
-
Nguyen, S.-N.1
-
35
-
-
0035754862
-
A verifiable secret shuffle and its application to E-voting
-
[Neff01]
-
[Neff01] Neff. A Verifiable Secret Shuffle and its Application to E-Voting, ACMCCS'01 pp. 116-125.
-
ACMCCS'01
, pp. 116-125
-
-
Neff1
-
36
-
-
0031698965
-
One-time zero-knowledge authentications and their applications to untraceable electronic cash
-
[OO98]
-
[OO98] Okamoto, Ohta. One-Time Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, vol E81-A, No. 1, pp. 2-10, 1998.
-
(1998)
IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences
, vol.E81-A
, Issue.1
, pp. 2-10
-
-
Okamoto, O.1
-
37
-
-
35048823260
-
An improvement of a practical secret voting scheme
-
[OMAFO99]
-
[OMAFO99] Ookubo, Miura, Abe, Fujioka, Okamoto. An improvement of a practical secret voting scheme. ISW'99, pp. 37-46.
-
ISW'99
, pp. 37-46
-
-
Ookubo, M.1
Abe, F.2
Okamoto3
-
38
-
-
84958615260
-
Detachable electronic coins
-
[PBF99]
-
[PBF99] Pavlovski, Boyd, Foo. Detachable Electronic Coins. ICICS'99, pp. 54-70.
-
ICICS'99
, pp. 54-70
-
-
Pavlovski, B.1
Foo2
-
39
-
-
85030460443
-
A threshold cryptosystem without a trusted party
-
[P91]
-
[P91] Torben P. Pedersen. A Threshold Cryptosystem without a Trusted Party. EUROCRYPT'91, pp.522-526.
-
EUROCRYPT'91
, pp. 522-526
-
-
Pedersen, T.P.1
-
40
-
-
77952330146
-
Restricted anonymous participation
-
[S00] (Japanese)
-
[S00] Sako. Restricted Anonymous Participation. SCIS'OO, B12. (Japanese).
-
SCIS'OO
, vol.B12
-
-
Sako1
-
41
-
-
84955615815
-
Secure voting using partially compatible homomorphisms
-
[SK94]
-
[SK94] Sako, Kilian. Secure Voting using Partially Compatible Homomorphisms. CRYPTO '94, pp. 411-424.
-
CRYPTO '94
, pp. 411-424
-
-
Sako, K.1
-
42
-
-
33745837115
-
Tag signature
-
[TF03] (Japanese. Preliminary version of [TFS04])
-
[TF03] Teranishi, Furukawa. Tag Signature. SCIS'03, 6C-2. (Japanese. Preliminary version of [TFS04]).
-
SCIS'03
, vol.6 C-2
-
-
Teranishi, F.1
-
43
-
-
35048839792
-
K-times anonymous authentication
-
[TFS04]
-
[TFS04] Teranishi, Furukawa, Sako. k-Times Anonymous Authentication. ASIACRYPT'04, pp. 308-322.
-
ASIACRYPT'04
, pp. 308-322
-
-
Teranishi, F.1
Sako2
|