Tag: cr.crypto-security
Found 124 results for 'cr.crypto-security'.
1) cc.complexity-theory - Learning with (Signed) Errors
2) graph-theory - Generating Graphs with Trivial Automorphisms
3) cr.crypto-security - Can entropicly secure encryption algorithms be used on low-entropy messages by adding noise
4) cc.complexity-theory - Is there a Boolean formula that is resistant to bias from a polytime adversary?
5) cr.crypto-security - Question on cryptographic advantage
6) cr.crypto-security - If I know pretty well '(a,b)', I know pretty well 'a', or 'b', or 'a xor b'
7) cc.complexity-theory - NP-Complete Hard-on-Average Problems
8) cr.crypto-security - Why isn't Montgomery modular exponentiation considered for use in quantum factoring?
9) cc.complexity-theory - Noisy Parity (LWE) lower bounds/hardness results
10) cr.crypto-security - A theorem regarding statistically-hiding commitment schemes
11) reference-request - Quantum Hardness of Approximating Lattice Problems
12) reference-request - Motivating Talk on Foundations of Cryptography
13) cr.crypto-security - Is public-key spread-spectrum communication possible?
14) cr.crypto-security - Can one reverse a hash with partial plaintext knowledge?
15) cr.crypto-security - MACing from an arbitrary high min-entropy shared secret
16) cr.crypto-security - Are there established cryptographic hardness assumptions for chaotic systems?
17) graph-theory - Resources on Cryptographic Applications of Expander Graphs
18) cc.complexity-theory - The Complexity of Advice in Computational Indistinguishability
19) cr.crypto-security - One-Way Permutations without Trapdoor
20) cc.complexity-theory - Is the integer factorization problem harder than RSA factorization: $n = pq$?
21) cc.complexity-theory - Non-Uniform vs. Uniform Adversaries
22) np-hardness - Password hashing using NP complete problems
23) cc.complexity-theory - Finite One-Way Permutation with Infinite Domain
24) cr.crypto-security - Simple candidates for pseudorandom permutations?
25) cc.complexity-theory - Worlds Relative to Which "Invulnerable Generators" Do Not Exist
26) cc.complexity-theory - Public-key encryption without the assumption that $P \neq NP$
27) cc.complexity-theory - Hardness of approximation assuming the existence of one-way functions
28) cc.complexity-theory - Do "One Way Functions" have any applications outside crypto ?
29) cr.crypto-security - How does Theoretical Computer Science relate to security?
30) cc.complexity-theory - Consequences of Factoring being in P?
31) cc.complexity-theory - How to calculate the cost of factoring a large integer?
32) cc.complexity-theory - What languages have been successfully cryptographically trapdoored?
33) cr.crypto-security - Deciding DDH based in partial information
34) cr.crypto-security - Choices for the group in Public Key Cryptography
35) cr.crypto-security - Difference between theory and practice of security and cryptography?
36) reference-request - Reference on cryptography methods
37) cr.crypto-security - What is special about $2^{32}/\phi$ in cryptography?
38) cr.crypto-security - Cryptography with very small keys
39) graph-theory - Cryptography protocols using graph problem instances
40) cc.complexity-theory - How to properly define a zero-knowledge proof system with oracle access
41) cr.crypto-security - question about concurrent ZK paper by Prabhakaran & Sahai
42) cr.crypto-security - Jointly Establishing a Shared Random String for NIZK proofs of knowledge
43) cr.crypto-security - Existence of zero-knowledge proof for location
44) reference-request - Does bit commitment yield oblivious transfer in the information-theoretic security model?
45) cc.complexity-theory - Why is the security of lattice cryptosystems not provable from $P \neq NP$?
46) cc.complexity-theory - Would an NP-complete public key cryptosystem imply NP=co-NP?
47) cr.crypto-security - Is signing a message hash a valid replacement for blind signature?
48) ds.algorithms - Confidentiality of "partial private keys" in certificateless public key crypto
49) cr.crypto-security - Encrypting or obfuscating transport stream identifiers in SSL-like connections
50) reference-request - Algorithm Design for only Mutual Information Sharing