Sciweavers

403 search results - page 1 / 81
» An algebra for commitment protocols
Sort
View
AAMAS
2007
Springer
13 years 4 months ago
An algebra for commitment protocols
Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of pro...
Ashok U. Mallya, Munindar P. Singh
ASIACRYPT
1999
Springer
13 years 9 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
13 years 9 months ago
Non-Interactive and Non-Malleable Commitment
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...
CRYPTO
2009
Springer
89views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
Linear Algebra with Sub-linear Zero-Knowledge Arguments
We suggest practical sub-linear size zero-knowledge arguments for statements involving linear algebra. Given commitments to matrices over a finite field, we give a sub-linear siz...
Jens Groth
CSFW
1995
IEEE
13 years 8 months ago
Modelling and verifying key-exchange protocols using CSP and FDR
We discuss the issues involved in modelling and verifying key-exchange protocols within the framework of CSP and its model-checking tool FDR. Expressing such protocols within a pr...
A. W. Roscoe