Sciweavers

1562 search results - page 178 / 313
» Mathematics, Cryptology, Security
Sort
View
EUROCRYPT
2007
Springer
14 years 2 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
14 years 1 months ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...
CCS
1998
ACM
14 years 16 days ago
A Specification of Java Loading and Bytecode Verification
This paper gives a mathematical specification the Java Virtual Machine (JVM) bytecode verifier. The specification is an axiomatic description of the verifier that makes precise su...
Allen Goldberg
CANS
2010
Springer
150views Cryptology» more  CANS 2010»
13 years 6 months ago
Predicate Encryption with Partial Public Keys
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...