31 search results - page 5 / 7 » Efficient Non-malleable Commitment Schemes |
80
Voted
ICCD
2004
IEEE
15 years 6 months ago
2004
IEEE
Modern superscalar microprocessors need sizable register files to support large number of in-flight instructions for exploiting ILP. An alternative to building large register file...
80
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
FCS
2006
14 years 11 months ago
2006
- Oblivious transfer OT is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any informa...
CISC
2008
Springer
14 years 11 months ago
2008
Springer
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity ...
79
Voted
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...