-
1
-
-
33645830920
-
-
Sep.
-
T. O'Reilly, "What is Web 2.0, " http://www.oreilly.de/artikel/ web20.html, Sep. 2005.
-
(2005)
What Is Web 2.0
-
-
O'reilly, T.1
-
3
-
-
2442435046
-
Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality
-
M. S. Franzin, E. C. Freuder, F. Rossi, and R. Wallace, "Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality, " AAAI Technical Report WS-02-13, 2002.
-
(2002)
AAAI Technical Report WS-02-13
-
-
Franzin, M.S.1
Freuder, E.C.2
Rossi, F.3
Wallace, R.4
-
4
-
-
34247234547
-
Experimental analysis of privacy loss in DCOP algorithms
-
DOI 10.1145/1160633.1160899, Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems
-
R. Greenstadt, J. P. Pearce, E. Bowring, and M. Tambe, "Experimental analysis of privacy loss in DCOP algorithms, " in Proc. of ACM AAMAS. New York: ACM Press, 2006, pp. 1424-1426. (Pubitemid 46609667)
-
(2006)
Proceedings of the International Conference on Autonomous Agents
, vol.2006
, pp. 1424-1426
-
-
Greenstadt, R.1
Pearce, J.P.2
Bowring, E.3
Tambe, M.4
-
5
-
-
10044289752
-
Secure distributed constraint satisfaction: Reaching agreement without revealing private information
-
M. Yokoo, K. Suzuki, and K. Hirayama, "Secure distributed constraint satisfaction: Reaching agreement without revealing private information, " Artificial Intelligence, vol. 161, pp. 229-245, 2005.
-
(2005)
Artificial Intelligence
, vol.161
, pp. 229-245
-
-
Yokoo, M.1
Suzuki, K.2
Hirayama, K.3
-
6
-
-
84870221289
-
Security requirements for non-political internet voting
-
ser. LNI, R. Krimmer, Ed., GI
-
R. Grimm, R. Krimmer, N. Meißner, K. Reinhard, M. Volkamer, and M. Weinand, "Security requirements for non-political internet voting, " in Electronic Voting, ser. LNI, R. Krimmer, Ed., vol. 86. GI, 2006, pp. 203-212.
-
(2006)
Electronic Voting
, vol.86
, pp. 203-212
-
-
Grimm, R.1
Krimmer, R.2
Meißner, N.3
Reinhard, K.4
Volkamer, M.5
Weinand, M.6
-
7
-
-
49049106141
-
Analysis of security requirements for cryptographic voting protocols (extended abstract)
-
O. Cetinkaya, "Analysis of security requirements for cryptographic voting protocols (extended abstract), " in ARES. IEEE Computer Society, 2008, pp. 1451-1456.
-
(2008)
ARES. IEEE Computer Society
, pp. 1451-1456
-
-
Cetinkaya, O.1
-
8
-
-
77954393000
-
Revisiting legal and regulatory requirements for secure e-voting
-
A. Ghonaimy, M. T. El-Hadidi, and H. K. Aslan, Eds., Kluwer
-
L. Mitrou, D. Gritzalis, and S. K. Katsikas, "Revisiting legal and regulatory requirements for secure e-voting, " in SEC, ser. IFIP Conference Proceedings, A. Ghonaimy, M. T. El-Hadidi, and H. K. Aslan, Eds., vol. 214. Kluwer, 2002, pp. 469-480.
-
(2002)
SEC, Ser. IFIP Conference Proceedings
, vol.214
, pp. 469-480
-
-
Mitrou, L.1
Gritzalis, D.2
Katsikas, S.K.3
-
9
-
-
34047208233
-
Voting system requirements
-
Feb.
-
E. Gerck, "Voting system requirements, " The Bell, vol. 2, no. 2, pp. 3-15, Feb. 2001.
-
(2001)
The Bell
, vol.2
, Issue.2
, pp. 3-15
-
-
Gerck, E.1
-
12
-
-
70849084368
-
-
Feb.
-
A. Pfitzmann and M. Hansen, "Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management - a consolidated proposal for terminology, " http://dud.inf.tudresden.de/ AnonTerminology.shtml Feb. 2008, v0.31.
-
(2008)
Anonymity, Unlinkability, Undetectability, Unobservability, Pseudonymity, and Identity Management - A Consolidated Proposal for Terminology
, vol.31
-
-
Pfitzmann, A.1
Hansen, M.2
-
13
-
-
0019532104
-
Untraceable electronic mail, return addresses, and digital pseudonyms
-
D. L. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms, " Commun. ACM, vol. 24, no. 2, pp. 84-90, 1981.
-
(1981)
Commun. ACM
, vol.24
, Issue.2
, pp. 84-90
-
-
Chaum, D.L.1
-
14
-
-
0022188127
-
A robust and verifiable cryptographically secure election scheme
-
Washington, DC, USA: IEEE Computer Society
-
J. D. Cohen and M. J. Fischer, "A robust and verifiable cryptographically secure election scheme, " in SFCS '85: Proceedings of the 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). Washington, DC, USA: IEEE Computer Society, 1985, pp. 372-382.
-
(1985)
SFCS '85: Proceedings of The 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)
, pp. 372-382
-
-
Cohen, J.D.1
Fischer, M.J.2
-
15
-
-
84883938043
-
Distributing the power of a government to enhance the privacy of voters
-
New York, NY, USA: ACM
-
J. C. Benaloh and M. Yung, "Distributing the power of a government to enhance the privacy of voters, " in PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing. New York, NY, USA: ACM, 1986, pp. 52-62.
-
(1986)
PODC '86: Proceedings of The Fifth Annual ACM Symposium on Principles of Distributed Computing
, pp. 52-62
-
-
Benaloh, J.C.1
Yung, M.2
-
16
-
-
77954124943
-
A practical secret voting scheme for large scale elections
-
J. Seberry and Y. Zheng, Eds., Springer
-
A. Fujioka, T. Okamoto, and K. Ohta, "A practical secret voting scheme for large scale elections, " in AUSCRYPT, ser. Lecture Notes in Computer Science, J. Seberry and Y. Zheng, Eds., vol. 718. Springer, 1992, pp. 244-251.
-
(1992)
AUSCRYPT, Ser. Lecture Notes In Computer Science
, vol.718
, pp. 244-251
-
-
Fujioka, A.1
Okamoto, T.2
Ohta, K.3
-
17
-
-
85027158725
-
Efficient anonymous channel and all/nothing election scheme
-
C. Park, K. Itoh, and K. Kurosawa, "Efficient anonymous channel and all/nothing election scheme, " in EUROCRYPT, 1993, pp. 248-259.
-
(1993)
EUROCRYPT
, pp. 248-259
-
-
Park, C.1
Itoh, K.2
Kurosawa, K.3
-
19
-
-
0002986502
-
Fault tolerant anonymous channel
-
Y. Han, T. Okamoto, and S. Qing, Eds., Springer
-
W. Ogata, K. Kurosawa, K. Sako, and K. Takatani, "Fault tolerant anonymous channel, " in ICICS, ser. Lecture Notes in Computer Science, Y. Han, T. Okamoto, and S. Qing, Eds., vol. 1334. Springer, 1997, pp. 440-444.
-
(1997)
ICICS, Ser. Lecture Notes In Computer Science
, vol.1334
, pp. 440-444
-
-
Ogata, W.1
Kurosawa, K.2
Sako, K.3
Takatani, K.4
-
20
-
-
84957715741
-
Universally verifiable mix-net with verification work indendent of the number of mix-servers
-
M. Abe, "Universally verifiable mix-net with verification work indendent of the number of mix-servers, " in EUROCRYPT, 1998, pp. 437-447.
-
(1998)
EUROCRYPT
, pp. 437-447
-
-
Abe, M.1
-
21
-
-
84957709438
-
A practical mix
-
M. Jakobsson, "A practical mix, " in EUROCRYPT, 1998, pp. 448-461.
-
(1998)
EUROCRYPT
, pp. 448-461
-
-
Jakobsson, M.1
-
22
-
-
0034771832
-
Practical multi-candidate election system
-
New York, NY, USA: ACM
-
O. Baudron, P.-A. Fouque, D. Pointcheval, J. Stern, and G. Poupard, "Practical multi-candidate election system, " in PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing. New York, NY, USA: ACM, 2001, pp. 274-283.
-
(2001)
PODC '01: Proceedings of The Twentieth Annual ACM Symposium on Principles of Distributed Computing
, pp. 274-283
-
-
Baudron, O.1
Fouque, P.-A.2
Pointcheval, D.3
Stern, J.4
Poupard, G.5
-
23
-
-
0028192744
-
Electronic voting scheme allowing open objection to the tally
-
K. Sako, "Electronic voting scheme allowing open objection to the tally, " IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 77, no. 1, pp. 24-30, 1994.
-
(1994)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
, vol.77
, Issue.1
, pp. 24-30
-
-
Sako, K.1
-
24
-
-
84948123363
-
An improvement on a practical secret voting scheme
-
M. Mambo and Y. Zheng, Eds. vol. Springer
-
M. Ohkubo, F. Miura, M. Abe, A. Fujioka, and T. Okamoto, "An improvement on a practical secret voting scheme, " in ISW, ser. Lecture Notes in Computer Science, M. Mambo and Y. Zheng, Eds., vol. 1729. Springer, 1999, pp. 225-234.
-
(1999)
ISW, Ser. Lecture Notes In Computer Science
, vol.1729
, pp. 225-234
-
-
Ohkubo, M.1
Miura, F.2
Abe, M.3
Fujioka, A.4
Okamoto, T.5
-
26
-
-
85034632918
-
Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA
-
D. Chaum, "Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA, " in EUROCRYPT, 1988, pp. 177-182.
-
(1988)
EUROCRYPT
, pp. 177-182
-
-
Chaum, D.1
-
27
-
-
2342617507
-
Secret-ballot receipts: True voter-verifiable elections
-
Jan.-Feb.
-
-, "Secret-ballot receipts: True voter-verifiable elections, " Security & Privacy, IEEE, vol. 2, no. 1, pp. 38-47, Jan.-Feb. 2004.
-
(2004)
Security & Privacy, IEEE
, vol.2
, Issue.1
, pp. 38-47
-
-
-
28
-
-
33646028830
-
A practical voterverifiable election scheme
-
ser. Lecture Notes in Computer Science,/, Springer Berlin/Heidelberg, 2005, [Online]. Available
-
D. Chaum, P. Y. Ryan, and S. Schneider, "A practical voterverifiable election scheme, " in Computer Security - ESORICS 2005, ser. Lecture Notes in Computer Science, vol. 3679/2005. Springer Berlin/Heidelberg, 2005, pp. 118-139. [Online]. Available: http://www.springerlink.com/content/ ebrbl9kc81bhx98j/.
-
(2005)
Computer Security - ESORICS 2005
, vol.3679
, pp. 118-139
-
-
Chaum, D.1
Ryan, P.Y.2
Schneider, S.3
-
29
-
-
44649122725
-
Scantegrity: End-to-end voter-verifiable optical- scan voting
-
May-June
-
D. Chaum, A. Essex, R. Carback, J. Clark, S. Popoveniuc, A. Sherman, and P. Vora, "Scantegrity: End-to-end voter-verifiable optical- scan voting, " Security & Privacy, IEEE, vol. 6, no. 3, pp. 40-46, May-June 2008.
-
(2008)
Security & Privacy, IEEE
, vol.6
, Issue.3
, pp. 40-46
-
-
Chaum, D.1
Essex, A.2
Carback, R.3
Clark, J.4
Popoveniuc, S.5
Sherman, A.6
Vora, P.7
-
30
-
-
80052018605
-
-
in EVT, D. L. Dill and T. Kohno, Eds. USENIX Association, [Online]. Available
-
D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryan, E. Shen, and A. T. Sherman, "Scantegrity II: End-to-end verifiability for optical scan election systems using invisible ink confirmation codes." in EVT, D. L. Dill and T. Kohno, Eds. USENIX Association, 2008. [Online]. Available: http://dblp.uni-trier.de/db/conf/uss/evt2008. html#ChaumCCEPRRSS08.
-
(2008)
Scantegrity II: End-to-end Verifiability for Optical Scan Election Systems Using Invisible Ink Confirmation Codes
-
-
Chaum, D.1
Carback, R.2
Clark, J.3
Essex, A.4
Popoveniuc, S.5
Rivest, R.L.6
Ryan, P.Y.A.7
Shen, E.8
Sherman, A.T.9
-
31
-
-
38549086047
-
Bingo voting: Secure and coercion-free voting using a trusted random number generator
-
ser. Lecture Notes in Computer Science, A. Alkassar and M. Volkamer, Eds., Springer
-
J.-M. Bohli, J. Müller-Quade, and S. Röhrich, "Bingo voting: Secure and coercion-free voting using a trusted random number generator, " in VOTE-ID, ser. Lecture Notes in Computer Science, A. Alkassar and M. Volkamer, Eds., vol. 4896. Springer, 2007, pp. 111-124.
-
(2007)
VOTE-ID
, vol.4896
, pp. 111-124
-
-
Bohli, J.-M.1
Müller-Quade, J.2
Röhrich, S.3
-
32
-
-
0022145479
-
Security without identification: Transaction systems to make big brother obsolete
-
D. Chaum, "Security without identification: Transaction systems to make big brother obsolete, " Commun. ACM, vol. 28, no. 10, pp. 1030-1044, 1985.
-
(1985)
Commun. ACM
, vol.28
, Issue.10
, pp. 1030-1044
-
-
Chaum, D.1
-
36
-
-
0023861309
-
The dining cryptographers problem: Unconditional sender and recipient untraceability
-
Jan. [Online]. Available
-
D. Chaum, "The dining cryptographers problem:unconditional sender and recipient untraceability, " Journal of Cryptology, vol. 1, no. 1, pp. 65-75, Jan. 1988. [Online]. Available: http://www.springerlink.com/content/ m74414x28822u525/.
-
(1988)
Journal of Cryptology
, vol.1
, Issue.1
, pp. 65-75
-
-
Chaum, D.1
-
37
-
-
0017018484
-
New directions in cryptography
-
W. Diffie and M. E. Hellman, "New directions in cryptography, " IEEE Transactions on Information Theory, vol. IT-22, no. 6, pp. 644-654, 1976.
-
(1976)
IEEE Transactions on Information Theory
, vol.IT-22
, Issue.6
, pp. 644-654
-
-
Diffie, W.1
Hellman, M.E.2
-
38
-
-
33746644570
-
Multilateral security: Enabling technologies and their evaluation
-
ser. Lecture Notes in Computer Science, G. Müller, Ed., Springer
-
A. Pfitzmann, "Multilateral security: Enabling technologies and their evaluation, " in ETRICS, ser. Lecture Notes in Computer Science, G. Müller, Ed., vol. 3995. Springer, 2006, pp. 1-13.
-
(2006)
ETRICS
, vol.3995
, pp. 1-13
-
-
Pfitzmann, A.1
-
39
-
-
1642281602
-
Privacy-enhancing identity management
-
M. Hansen, P. Berlich, J. Camenisch, S. Clauß, A. Pfitzmann, and M. Waidner, "Privacy-enhancing identity management, " Information Security Technical Report, vol. 9, no. 1, pp. 35-44, 2004.
-
(2004)
Information Security Technical Report
, vol.9
, Issue.1
, pp. 35-44
-
-
Hansen, M.1
Berlich, P.2
Camenisch, J.3
Clauß, S.4
Pfitzmann, A.5
Waidner, M.6
-
40
-
-
85026581986
-
Helios: Web-based open-audit voting
-
P. C. van Oorschot, Ed. USENIX Association
-
B. Adida, "Helios: Web-based open-audit voting, " in USENIX Security Symposium, P. C. van Oorschot, Ed. USENIX Association, 2008, pp. 335-348.
-
(2008)
USENIX Security Symposium
, pp. 335-348
-
-
Adida, B.1
|