Sciweavers

403 search results - page 43 / 81
» An algebra for commitment protocols
Sort
View
124
Voted
IACR
2011
113views more  IACR 2011»
14 years 4 months ago
GNUC: A New Universal Composability Framework
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
Dennis Hofheinz, Victor Shoup
DALT
2004
Springer
15 years 8 months ago
Norm Verification and Analysis of Electronic Institutions
Electronic institutions are a formalism to define and analyse protocols among agents with a view to achieving global and individual goals. In this paper we propose a definition of ...
Wamberto Weber Vasconcelos
FASE
2008
Springer
15 years 6 months ago
When Things Go Wrong: Interrupting Conversations
Abstract. This paper presents a true-concurrent approach to formalising integration of Small-to-Medium Enterprises (SMEs) with Web services. Our approach formalises common notions ...
Juliana Küster Filipe Bowles, Sotiris Moschoy...
FM
2001
Springer
130views Formal Methods» more  FM 2001»
15 years 9 months ago
Towards a Topos Theoretic Foundation for the Irish School of Constructive Mathematics
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
Mícheál Mac an Airchinnigh
162
Voted
ASIACRYPT
2001
Springer
15 years 8 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois