Sciweavers

659 search results - page 110 / 132
» Compiling and securing cryptographic protocols
Sort
View
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
CCS
2009
ACM
14 years 3 months ago
Multi-party off-the-record messaging
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...
Ian Goldberg, Berkant Ustaoglu, Matthew Van Gundy,...
CCS
2007
ACM
14 years 2 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
GD
2008
Springer
13 years 9 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...
ACSAC
2000
IEEE
14 years 28 days ago
A Novel Approach to On-Line Status Authentication of Public-Key Certificates
The widespread use of public networks, such as the Internet, for the exchange of sensitive data, like legally valid documents and business transactions, poses severe security cons...
Eugenio Faldella, Marco Prandini