How to Shuffle in Public-Reference-Cited by-同舟云学术

How to Shuffle in Public

Published: Issue: Volume: Page:555-574
ISSN:
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Adida Ben,Wikström Douglas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70936-7_30.pdf

Reference30 articles.

1. Lecture Notes in Computer Science;M. Abe,2003

2. Lecture Notes in Computer Science;B. Barak,2001

3. Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., Poupard, G.: Practical multi-candidate election system. In: 20th ACM Symposium on Principles of Distributed Computing – PODC, pp. 274–283. ACM Press, New York (2001)

4. Lecture Notes in Computer Science;M. Bellare,1998

5. Benaloh, J., Yung, M.: Distributing the power of a government to enhance the privacy of voters. In: 5th ACM Symposium on Principles of Distributed Computing – PODC, pp. 52–62. ACM Press, New York (1986)

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries;Information and Computation;2021-12

2. Non-Interactive Anonymous Router;Lecture Notes in Computer Science;2021

3. A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing;Computer Security – ESORICS 2020;2020

4. Repeatable Oblivious Shuffling of Large Outsourced Data Blocks;Proceedings of the ACM Symposium on Cloud Computing;2019-11-20

5. Practical Access Pattern Privacy by Combining PIR and Oblivious Shuffle;Proceedings of the 28th ACM International Conference on Information and Knowledge Management;2019-11-03