Sciweavers

3115 search results - page 164 / 623
» Synthesizing Secure Protocols
Sort
View
CRYPTO
2008
Springer
76views Cryptology» more  CRYPTO 2008»
14 years 12 months ago
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Ivan Damgård, Yuval Ishai, Mikkel Krø...
IPL
2006
118views more  IPL 2006»
14 years 10 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
78
Voted
JCP
2006
120views more  JCP 2006»
14 years 10 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
FOCS
2010
IEEE
14 years 8 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
DATE
2006
IEEE
86views Hardware» more  DATE 2006»
15 years 4 months ago
Synthesis of system verilog assertions
In recent years, Assertion-Based Verification is being widely accepted as a key technology in the pre-silicon validation of system-on-chip(SOC) designs. The System Verilog langua...
Sayantan Das, Rizi Mohanty, Pallab Dasgupta, P. P....