679 search results - page 74 / 136 » Using decision problems in public key cryptography |
CHES
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in critical operations such as modular exponentiati...
139
click to vote
JOC
2006
15 years 1 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
IPL
2007
15 years 1 months ago
2007
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
110
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
148
click to vote
IACR
2011
14 years 1 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...