Cryptography What is the preferred approach to implementing blind signatures these days? |
- What is the preferred approach to implementing blind signatures these days?
- Can a cryptographic function be created that uses multiple keys but is decrypted by any combination of a subset of those keys?
- Can somebody help me decrypt RSA into ASCII??
What is the preferred approach to implementing blind signatures these days? Posted: 26 Nov 2018 12:04 PM PST I am working from this paper form 2009: "An Efficient Blind Signature Scheme Based on the Elliptic Curve Discrete Logarithm Problem" at http://www.isecure-journal.com/article_39171_47f9ec605dd3918c2793565ec21fcd7a.pdf Have there been any new developments, or is there a popular and/or audited library I should be using? Appreciate any pointers! [link] [comments] |
Posted: 26 Nov 2018 03:25 PM PST I am trying to find out if something like this exists. Here is what I am trying:
I believe there is a way to do this by using a nested key format. Each of the 10 secret keys could decrypt a message revealing one or two of the other keys. Somehow maybe those sub-key combinations could be arranged so that you have the entire set when a certain number have been revealed. My brain is too lazy after turkey hangover to work out the logic at the moment.... so i am curious is anyone has heard of such a function. [link] [comments] |
Can somebody help me decrypt RSA into ASCII?? Posted: 26 Nov 2018 01:43 PM PST |
You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment