403 search results - page 55 / 81 » An algebra for commitment protocols |
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
This paper exhibits the power of programming with dependent types by dint of embedding three domain-specific languages: Cryptol, a language for cryptographic protocols; a small da...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
TCC
2004
Springer
15 years 5 months ago
2004
Springer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
124
click to vote
RULES
1993
Springer
15 years 4 months ago
1993
Springer
Objects are collected into an object base because of a presumed need for cooperation among them. In classical object bases the cooperation is based on synchronous, preplanned mess...
107
click to vote
STOC
2006
ACM
16 years 5 days ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...