-
1
-
-
84898960610
-
Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations
-
M. Ben-Or, S. Goldwasser, A. Wigderson, “Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations,” STOC’88, pp. 1-10.
-
STOC’88
, pp. 1-10
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
2
-
-
84995460223
-
Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change
-
E. Brickell, P. Gemmell, D. Kravitz, “Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change,” Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995, pp. 457-466.
-
(1995)
Proc. 6Th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 457-466
-
-
Brickell, E.1
Gemmell, P.2
Kravitz, D.3
-
3
-
-
84949745296
-
Digital Payment Systems with Passive Anonymity-Revoking Trustees
-
J. Camenisch, U. Maurer, M. Stadler, “Digital Payment Systems with Passive Anonymity-Revoking Trustees,” Computer Security-ESORICS 96, volume 1146, pp. 33-43.
-
Computer Security-Esorics 96
, vol.1146
, pp. 33-43
-
-
Camenisch, J.1
Maurer, U.2
Stadler, M.3
-
4
-
-
0029714307
-
An Efficient Fair Payment System
-
J. Camenisch, J-M. Piveteau, M. Stadler, “An Efficient Fair Payment System,” 3rd ACM Conf. on Comp, and Comm. Security, 1996, pp. 88-94.
-
(1996)
3Rd ACM Conf. on Comp, and Comm. Security
, pp. 88-94
-
-
Camenisch, J.1
Piveteau, J.-M.2
Stadler, M.3
-
10
-
-
0023538330
-
A Practical Scheme for Non-Interactive Verifiable Secret Sharing
-
P. Feldman, “A Practical Scheme for Non-Interactive Verifiable Secret Sharing” FOCS’87, pp. 427-437.
-
FOCS’87
, pp. 427-437
-
-
Feldman, P.1
-
11
-
-
0042829814
-
Indirect Discourse Proofs: Achieving Efficient Fair Off-Line E-Cash
-
Y. Frankel, Y. Tsiounis, and M. Yung, “Indirect Discourse Proofs: Achieving Efficient Fair Off-Line E-Cash,” Advances in Cryptology-Proceedings of Asiacrypt 96, pp. 286-300.
-
Advances in Cryptology-Proceedings of Asiacrypt
, vol.96
, pp. 286-300
-
-
Frankel, Y.1
Tsiounis, Y.2
Yung, M.3
-
12
-
-
84947926543
-
Robust Threshold DSS Signatures
-
R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, “Robust Threshold DSS Signatures”, Advances in Cryptology-Proceedings of Eurocrypt’96, pp. 354-371.
-
Advances in Cryptology-Proceedings of Eurocrypt’96
, pp. 354-371
-
-
Gennaro, R.1
Jarecki, S.2
Krawczyk, H.3
Rabin, T.4
-
14
-
-
0030646698
-
M. Yung,’’Proactive Public Key and Signature Systems
-
A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung,’’Proactive Public Key and Signature Systems,” 4th ACM Conf. on Comp, and Comm. Security, 1997.
-
(1997)
4Th ACM Conf. on Comp, and Comm. Security
-
-
Herzberg, A.1
Jakobsson, M.2
Jarecki, S.3
Krawczyk, H.4
-
15
-
-
0000299804
-
Proactive Secret Sharing, or How to Cope with Perpetual Leakage
-
A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, “Proactive Secret Sharing, or How to Cope with Perpetual Leakage,” Advances in Cryptology-Proceedings of Crypto’95.
-
Advances in Cryptology-Proceedings of Crypto’95
-
-
Herzberg, A.1
Jarecki, S.2
Krawczyk, H.3
Yung, M.4
-
16
-
-
85066366869
-
Limits on the Provable Consequences of One-way Permutations
-
R. Impagliazzo and S. Rudich, Limits on the Provable Consequences of One-way Permutations, STOC’89.
-
STOC’89
-
-
Impagliazzo, R.1
Rudich, S.2
-
17
-
-
4043089808
-
-
PhD Thesis, University of California, San Diego, Department of Computer Science and Engineering
-
M. Jakobsson, “Privacy vs. Authenticity,” PhD Thesis, University of California, San Diego, Department of Computer Science and Engineering, 1997. Available at http://www-cse.ucsd.edu/users/markus/.
-
(1997)
Privacy Vs. Authenticity
-
-
Jakobsson, M.1
-
19
-
-
84956864804
-
Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System
-
M. Jakobsson and M. Yung, “Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System,” Financial Cryptography’97.
-
Financial Cryptography’97
-
-
Jakobsson, M.1
Yung, M.2
-
21
-
-
84877846965
-
Digital Signature Standard (DSS)
-
Aug 30
-
National Institute for Standards and Technology, “Digital Signature Standard (DSS),” Federal Register vol. 56(169), Aug 30, 1991.
-
(1991)
Federal Register
, vol.56
, Issue.169
-
-
-
23
-
-
50749133265
-
On Blind Signatures and Perfect Crimes
-
S. von Solms and D. Naccache, “On Blind Signatures and Perfect Crimes,” Computers and Security, 11 (1992) pp. 581-583.
-
(1992)
Computers and Security
, vol.11
, pp. 581-583
-
-
Von Solms, S.1
Naccache, D.2
-
24
-
-
0018545449
-
How to Share a Secret
-
A. Shamir, “How to Share a Secret,” CACM, V. 22, 1979, pp. 612-613.
-
(1979)
CACM, V
, vol.22
, pp. 612-613
-
-
Shamir, A.1
|