Sciweavers

403 search results - page 22 / 81
» An algebra for commitment protocols
Sort
View
EUROCRYPT
1999
Springer
15 years 4 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
JCS
2006
91views more  JCS 2006»
14 years 11 months ago
A survey of algebraic properties used in cryptographic protocols
Abstract: Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches usually consider the encryption schemes as black boxes and assume that ...
Véronique Cortier, Stéphanie Delaune...
ATAL
2003
Springer
15 years 3 months ago
Posit spaces: a performative model of e-commerce
What distinguishes e-commerce from ordinary commerce? What distinguishes it from distributed computation? In this paper we propose a performative theory of e-commerce, drawing on ...
Peter McBurney, Simon Parsons
CORR
2007
Springer
150views Education» more  CORR 2007»
14 years 11 months ago
Composable Security in the Bounded-Quantum-Storage Model
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
Stephanie Wehner, Jürg Wullschleger
AI
2004
Springer
15 years 5 months ago
A Principled Modular Approach to Construct Flexible Conversation Protocols
Building conversation protocols has traditionally been an art more than a science, as their construction is often guided by designers’ intuition rather than by a principled appro...
Roberto A. Flores, Robert C. Kremer