-
1
-
-
0001604533
-
Blind signatures for untraceable payments
-
D. Chaum, "Blind signatures for untraceable payments," in CRYPTO '82.
-
CRYPTO '82
-
-
Chaum, D.1
-
3
-
-
84914126295
-
Auditable, anonymous electronic cash
-
T. Sander and A. Ta-Shma, "Auditable, anonymous electronic cash," in CRYPTO '99.
-
CRYPTO '99
-
-
Sander, T.1
Ta-Shma, A.2
-
5
-
-
84940423444
-
Bitter to better - How to make Bitcoin a better currency
-
S. Barber, X. Boyen, E. Shi, and E. Uzun, "Bitter to better - how to make Bitcoin a better currency," in FC '12.
-
FC '12
-
-
Barber, S.1
Boyen, X.2
Shi, E.3
Uzun, E.4
-
9
-
-
79952505412
-
Short pairing-based non-interactive zero-knowledge arguments
-
J. Groth, "Short pairing-based non-interactive zero-knowledge arguments," in ASIACRYPT '10.
-
ASIACRYPT '10
-
-
Groth, J.1
-
10
-
-
84879830090
-
Progression-free sets and sublinear pairing-based noninteractive zero-knowledge arguments
-
H. Lipmaa, "Progression-free sets and sublinear pairing-based noninteractive zero-knowledge arguments," in TCC '12.
-
TCC '12
-
-
Lipmaa, H.1
-
11
-
-
84879803964
-
Succinct non-interactive arguments via linear interactive proofs
-
N. Bitansky, A. Chiesa, Y. Ishai, R. Ostrovsky, and O. Paneth, "Succinct non-interactive arguments via linear interactive proofs," in TCC '13.
-
TCC '13
-
-
Bitansky, N.1
Chiesa, A.2
Ishai, Y.3
Ostrovsky, R.4
Paneth, O.5
-
14
-
-
84889685593
-
SNARKs for C: Verifying program executions succinctly and in zero knowledge
-
E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza, "SNARKs for C: verifying program executions succinctly and in zero knowledge," in CRYPTO '13.
-
CRYPTO '13
-
-
Ben-Sasson, E.1
Chiesa, A.2
Genkin, D.3
Tromer, E.4
Virza, M.5
-
15
-
-
85051020443
-
Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
-
H. Lipmaa, "Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes," in ASIACRYPT '13.
-
ASIACRYPT '13
-
-
Lipmaa, H.1
-
17
-
-
84914126286
-
Information propagation in the Bitcoin network
-
C. Decker and R. Wattenhofer, "Information propagation in the Bitcoin network," in P2P '13.
-
P2P '13
-
-
Decker, C.1
Wattenhofer, R.2
-
19
-
-
84914126284
-
Pinocchio coin: Building Zerocoin from a succinct pairing-based proof system
-
[Online]
-
G. Danezis, C. Fournet, M. Kohlweiss, and B. Parno, "Pinocchio Coin: building Zerocoin from a succinct pairing-based proof system," in PETShop '13. [Online]. Available: http://www0.cs.ucl.ac.uk/staff/G. Danezis/papers/DanezisFournetKohlweissParno13.pdf
-
PETShop '13
-
-
Danezis, G.1
Fournet, C.2
Kohlweiss, M.3
Parno, B.4
-
22
-
-
33645588981
-
Secure identity based encryption without random oracles
-
D. Boneh and X. Boyen, "Secure identity based encryption without random oracles," in CRYPTO '04.
-
CRYPTO '04
-
-
Boneh, D.1
Boyen, X.2
-
23
-
-
84914126281
-
Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks
-
R. Gennaro, "Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks," in CRYPTO '04.
-
CRYPTO '04
-
-
Gennaro, R.1
-
24
-
-
85134315885
-
Separating succinct non-interactive arguments from all falsifiable assumptions
-
C. Gentry and D. Wichs, "Separating succinct non-interactive arguments from all falsifiable assumptions," in STOC '11.
-
STOC '11
-
-
Gentry, C.1
Wichs, D.2
-
25
-
-
84856494511
-
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
-
N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer, "From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again," in ITCS '12.
-
ITCS '12
-
-
Bitansky, N.1
Canetti, R.2
Chiesa, A.3
Tromer, E.4
-
26
-
-
84905400056
-
Zerocash: Decentralized anonymous payments from Bitcoin (extended version)
-
E. Ben-Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza, "Zerocash: Decentralized anonymous payments from Bitcoin (extended version)," Cryptology ePrint Archive, 2014.
-
(2014)
Cryptology EPrint Archive
-
-
Ben-Sasson, E.1
Chiesa, A.2
Garman, C.3
Green, M.4
Miers, I.5
Tromer, E.6
Virza, M.7
-
28
-
-
38549138054
-
New proofs for NMAC and HMAC: Security without collision-resistance
-
M. Bellare, "New proofs for NMAC and HMAC: security without collision-resistance," in CRYPTO '06.
-
CRYPTO '06
-
-
Bellare, M.1
-
30
-
-
17144422244
-
A proposal for an ISO standard for public key encryption (version 2.1)
-
V. Shoup, "A proposal for an ISO standard for public key encryption (version 2.1)," IACR E-Print Archive, 2001.
-
(2001)
IACR E-Print Archive
-
-
Shoup, V.1
-
31
-
-
23944524767
-
-
[Online]
-
Certicom Research, "SEC 1: Elliptic curve cryptography," 2000. [Online]. Available: http://www.secg.org/collateral/sec1 final.pdf
-
(2000)
SEC 1: Elliptic Curve Cryptography
-
-
-
33
-
-
84914126277
-
Mixminion: Design of a type III anonymous remailer protocol
-
G. Danezis, R. Dingledine, and N. Mathewson, "Mixminion: design of a type III anonymous remailer protocol," in SP '03.
-
SP '03
-
-
Danezis, G.1
Dingledine, R.2
Mathewson, N.3
|