Sciweavers

341 search results - page 63 / 69
» Deniable Functional Encryption
Sort
View
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
15 years 3 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
MA
1999
Springer
155views Communications» more  MA 1999»
15 years 2 months ago
JGram: Rapid Development of Multi-Agent Pipelines for Real-World Tasks
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...
Rahul Sukthankar, Antoine Brusseau, Ray Pelletier,...
NDSS
1998
IEEE
15 years 2 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
ITP
2010
159views Mathematics» more  ITP 2010»
15 years 2 months ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...
ACSAC
2004
IEEE
15 years 2 months ago
An Intrusion Detection Tool for AODV-Based Ad hoc Wireless Networks
Mobile ad hoc network routing protocols are highly susceptible to subversion. Previous research in securing these protocols has typically used techniques based on encryption and r...
Giovanni Vigna, Sumit Gwalani, Kavitha Srinivasan,...