Sciweavers

335 search results - page 43 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
LICS
1999
IEEE
13 years 12 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
DAC
1996
ACM
13 years 11 months ago
A Probability-Based Approach to VLSI Circuit Partitioning
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
Shantanu Dutt, Wenyong Deng
FM
1999
Springer
93views Formal Methods» more  FM 1999»
13 years 12 months ago
Group Principals and the Formalization of Anonymity
We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally usefu...
Paul F. Syverson, Stuart G. Stubblebine
CCS
2007
ACM
14 years 1 months ago
Alpaca: extensible authorization for distributed services
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
Chris Lesniewski-Laas, Bryan Ford, Jacob Strauss, ...
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters