Towards a security model for computational puzzle schemes (Q3101621): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160.2010.543951
+Normal rank
@@ Property / OpenAlex ID @@
+W2165688615
@@ Property / OpenAlex ID: W2165688615 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4786018
@@ Property / cites work: Q4786018 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536805
@@ Property / cites work: Q4536805 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341756
@@ Property / cites work: Q4341756 / rank @@
+Normal rank
@@ Property / cites work @@
+Security Notions and Generic Constructions for Client Puzzles
+Normal rank
@@ Property / cites work @@
+Applied Cryptography and Network Security
@@ Property / cites work: Applied Cryptography and Network Security / rank @@
+Normal rank
@@ Property / cites work @@
+Timed Release of Standard Digital Signatures
@@ Property / cites work: Timed Release of Standard Digital Signatures / rank @@
+Normal rank
@@ Property / cites work @@
+On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
+Normal rank
@@ Property / cites work @@
+Secure communications over insecure channels
@@ Property / cites work: Secure communications over insecure channels / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of a determinate algorithm for the discrete logarithm
+Normal rank